Главная страница  Алгебраическая теория кодирования 

[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66] [67] [68] [69] [70] [71] [72] [73] [ 74 ] [75] [76] [77] [78]

, [1968b] А Construction for Partitions which Avoid Long Arithmetic

Progressions, Canad. Math. Bull. 11, N 3, 409-414, 61-88.

-, [1970] Negacyclic Codes for the Lee Metric, chap. 17 in R.C. Bose and

T. A. Dowling (eds.,). Proceedings of the Conference on Combinatorial Mathematics and Its Applications (April 10-14, 1967), The University of North Carolina Press, Chapel Hill, N.C.

-, Рамсе Й, Соломон (Rumsey H., Solomon G.), [1967]

On the Solution of Algebraic Equations over Finite Fields, Inform. Control, 10, 553-564.

Биркгоф, Маклейн (Birkhoff G., MacLane S.), [1965] A Survey of Modem Algebra, 3d ed., The Macmillan Company, New York; Math. Rev., 31, 2250.

Боуз, Рой-Чоудхури (Bose R.C, Ray-Chaudhuri D. K.), [1960] On a Class of Error Correcting Binary Group Codes, Inform. Control, 3, 68-79, 279-290; Math. Rev., 22, 3619. (Русский перевод: Воуз P. К., Рой-Чоудхури Д. К., Об одном классе двоичных групповых кодов с исправлением ошибок. Кибернетический сборник, вып. 2, ИЛ, М., 1961, 83-94; Дальнейшие результаты относительно двоичных групповых кодов с исправлением ошибок, Кибернетический сборник, вып. 6, ИЛ, М., 1963, 7-12.)

Брилхарт, Селфридж (Brillhart J., Selfridge J. L.), [1967] Some Factorizations of 2" ± 1 and Related Results, Math. Computation, 21: 87-96.

, Цирлер (Zierler N.), [1968, 1969] On Irreducible Trinomials

Modulo 2, I, Inform. Control, 13, 541-544, II, ibid, 14, 566-569.

Бэрти, Шнейдер (Bartee Т. С, Schneider D. I.), [1963] Computation with Finite Fields, Inform. Control, 6, 79-98; Math. Rev., 28, 5854.

Вагнер (Wagner T. J.), [1965] A Remark Concerning the Minimum Distance of Binary Group Codes, IEEE Trans. Inform. Theory, ITll, 458.

, [1966a] A Search Technique for Quasi-perfect Codes, Inform. Control, 9,

94-99; Math. Rev., 32, 9151.

, [1966b] A Remark Concerning the Existence of Binary Quasi-perfect

Codes, IEEE Trans. Inform. Theory, IT12, 401.

, [1967] Some Additional Quasi-perfect Codes, Inform. Control, 10, 334.

Вайнер (Wyner A. D.), [1965] Capabilities of Bounded Discrepancy Decoding, Bell System Tech. J., 44, 1061-1122; Math. Rev., 31, 4652.

, Э Ш (Ash R. В.), [1963] Analysis of Recurrent Codes, IEEE Trans.

Inform. Theory, IT9, 143-156; Math. Rev., 29, 1088. (Русский перевод: Вайнер Э., Э ш Р., Анализ рекуррентных кодов. Кибернетический сборник, новая серия, вып. 5, «Мир», М., 1968.)

Вакс (WaxN.), [1959] On Upper Bounds for Error Detecting and Error Correcting Codes of Finite Length, IEEE Trans. Inform. Theory, IT5, 168-174; Math. Rev., 22, 1472. , , ,

Варден, Ван-дер -(Waerden B.L. van der), [1931] Moderne Algebra, Springer-Verlag ONG, Berlin. (Русский перевод: Ван-дер-Варден Б. Л., Современная алгебра, ч. I и II, Гостехиздат, М.- Л., 1947.)

Варшамов P.P., [1957] Оценка числа сигналов в кодах с коррекцией оши-бок, ДАН СССР, 117, № 5, 739-741.

Васильев Ю. Л., [19621 О негрупповых плотно упакованных кодах. Проблемы кибернетики, № 8, 337-339.

Велдон (Weldon Е. J. Jr.), [1966] Difference-set Cyclic Codes, Bell System Tech. J., 25, 1045-1055; Math. Rev., 34, 1101. (Русский перевод: Велдон И. Дж., Циклические коды, задаваемые разностными множествами, сб. «Некоторые вопросы теории кодирования», «Мир», М.,

*[19б8а1 New Generalizations of the Reed - MuUer Codes, Part II: Non-primitive Codes, IEEE Tram. Inform. Theory, 14, 199-205.

-, [1968b] Euclidean Geometry Cyclic Codes, chap. 23 in R.C. Bose and

T.A. Dowling (eds.). Proceedings of the Conference on Combinatorial Mathematics and its Applications (April 10-14, 1967), The University of North Carolina Press, Chapel Hill, N.C.

Велч (Welch L. R.), [1967] Частное сообщение.

Витерби (Viterbi A. J.), [1967] Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm, IEEE Trans. Inform. r/ieor,-IT13, 260-269. (Русский перевод: Витерби A., Границы ошибок для сверточных кодов и асимптотически оптимальный алгоритм декодирования, сб. «Некоторые вопросы теории кодирования», «Мир». М., 1970, 142-165.)

Возенкрафт, Джекобе (Wozencraft J.M., Jacobs I. М.), [1965] Principles of Communication Engineering, John Wiley & Sons, New York. (Русский перевод: В озенкрафт Дж., Д ж е к о б с И., Теоретические основы техники связи, «Мир», М., 1969.)

-, Рейффен (Reiffen В.), [1961] Sequential Decoding, The

М. I. Т. Press, Cambridge, Mass.; Math. Rev., 19, 824. (Русский перевод: Возенкрафт Дж., Рейффен Б., Последовательное декодирование, ИЛ, М., 1963.)

Вольфовиц (Wolfowitz J.), [1961] Coding Theorems of Information Theory, Springer-Verlag ONG, Berlin; Math. Rev., 26, 1227.

Вулф (Wolf J. K.), [1965a] On Codes Derivable form the Tensor Product of Check Matrices, IEEE Trans. Inform. Theory, 11, 281-284; Math. Rev., 32, 9152.

-, [1965b] On an Extended Glass of Error-Locating Codes, Inform. Control

8, 163-169; Math. Rev., 30, 5848. -, Элспас (Elspas В.), [1963] Error-Locating Codes - A New

Concept in Error Control, IEEE Trans. Inform. Theory, 9, 113-117; Math.

Rev., 29, 4623.

Галлагер (Gallager R. G.), [1963] Low Density Parity Check Codes, The M. I. T. Press, Cambridge, Mass. (abberviated version publiched in IEEE Trans. Inform. Theory, ITS, 21-28); Math. Rev., 24B, 2048. (Русский перевод: Галлагер P. Г., Коды с малой плотностью проверок на четность, сб. «Теория кодирования», «Мир», М., 1964, 139-165.)

-, [1965] А Simple Derivation of the Coding Theorem and Some Applications, IEEE Trans. Inform. Theory., ITll, 3-18; Math. Rev., 32, 3951. (Русский перевод: Галлагер P. Г., Простой вывод теоремы кодирования и некоторые применения. Кибернетический сборник, новая сепия, .вып. 3, «Мир», М., 1966.)

-, [1966] Binary Codes for Burst Error Corrections, IEEE Trans. Inform.

Theory, IT12, 273.

-, [1968] Information Theory &. Reliable Communication, John Wiley &

Sons, New York.

Гёталс (Goethals J. M.), [1965] Algebraic Structure and Weight Distribution of Binary Cyclic Codes, MBLE Res. Lad. (Belgium) Rept.

-, [1966] Analysis of Weight Distribution in Binary Cyclic Codes. IEEE

Trans. Inform. Theory, IT12, 401-402. -, [1967] Factorization of Cyclic Codes, IEEE Trans. Inform. Theory IT13

242-246; Math. Rev., 35, 5252. -J * p T (D e 1 s a r t e P.), [1968] On a Class of Majority Logic

Decodable Cyclic Codes, IEEE Trans. Inform. Theory, IT14, 182-188.

(Русский перевод: Гёталс Дж. М., Делзарт П., Один класс

циклических кодов с мажоритарным декодированием. Кибернетический

сборник, новая серия, вып. 6, «Мир», М., 1969.) -, Зейдель (Seidel J. J.), [1967] Orthogonal Matrices with Zero

Diagonal, Canad. J. Math., 19, 1001-lOlO.



Гилберт (Gilbert Е. N.), [1952] А Comparison of Signalling Alphabets,

Bell System Tech. J., 31, 504-522. Голей (Golay M. E.), [1949] Notes on Digital Coding, Proc. IRE, 37, 657. -, [1954] Binary Coding, IEEE Trans. Inform. Theory, IT4, 23-28; Math.

Rev., 19, 622.

-, [1958] Notes on the Penny-weighing Problem, Lossless Symbol Coding

with Nonprimes, etc., IEEE Trans. Inform. Theory, IT4, 103-109; Math. Rev., 22, 13354.

Голомб (Golomb S. W.), [1967] Shift Register Sequences, Holden-Day,

San Francisco, Calif. -, [1968] On the Cross-correlation of Shift Register Sequences, IEEE Trans.

Inform. Theory, IT14, в печати. --, Познер (Posner E. С), [1964] Rook Domains, Latin Squares,

Affine Planes and Error-distributing Codes, IEEE Trans. Inform. Theory,

ITIO, 196-208; Math. Rev., ?9, 5657. -, Велч (Welch L. R.), [1968] Error-correcting codes. Proceedings

of a Simposium conducted by the Mathematics Research Center United

States Army at the University of Wisconsin, Madson, May 6-8, 1968,

175-194.

Горенстейн, Питерсон, Цирлер (Gorenstein D. С, Peterson W.W., Zierler N.), [1960] Two-error Correcting Rose-Chaudhuri Codes Are Quasi-perfect, Inform. Control, 3, 291-294; Math. Rev., 22, 9350. (Русский перевод: Горенстейн Д., ПитерсонВ., Цирлер Н., Квазисовершенность кодов Боуза - Чоудхури с исправлением двух ошибок, Кибернетический сборник, вып. 6, ИЛ, М., ,1963, 20-24.)

-, Цирлер (Zierler N.), [1961] А Class of Error-correcting Codes

in Symbols, /. Soc. Indus. Appl. Math., 9, 207-214; Math. Rev., 24B, 450. (Русский перевод: Горенстейн Д., Цирлер Н., Класс кодов из рт символов с исправлением ошибок. Кибернетический сборник, вып. 7, ИЛ, М., 1963.)

Грайсмер (Griesmer J.H.), [1960] А Bound for Error-correcting Codes, /. Res. Develop., 4, 532; Math. Rev., 23B, 3081.

Грин (Green M. W.), [1966] Two Heuristic Techniques for Block-code Construction, IEEE Trans. Inform. Theory, IT12, 273.

Гросс (Gross A. J.), [1963] Augmented Bose-Chaudhuri Codes Which Correct Single Bursts of Errors, IEEE Trans. Inform. Theory, IT9, 121.

Грэхем, Мак-Вильямс (Graham R. L., M a с W i 11 i a m s F. J.), [1966] On the Number of Information Symbols in Difference set Cyclic Codes, Bell System Tech. /.,45, 1057-1070; Tlfatfe. flei;., 34, 1102. (Русский перевод: Грехом P., Мак-Вильямс Дж., О числе информационных символов циклических кодов, задаваемых разностными множествами, сб. «Некоторые вопросы теории кодирования», «Мир», М., 1970, 22-35.)

, Вайнер (W i п е г А. D.), [1968] An Upper Bound on the Minimum

Distance for a fc-ary Code, Inform. Control, 13, 46-52.

Д a в e H П о p T, Рут (Davenport W. В., Root W. L.), [1958] Introduction to Random Signals and Noise, McGraw-Hill Book Company, New York; Math. Rev., 19:1090. (Русский перевод: Давенпорт В., Рут В. Л., Введение в теорию случайных сигналов и шумов, ИЛ, М., 1960.)

Дален (Dalen К.), [1955] On а Theorem of Stiekelberger, Math. Scand.,

3, 124-126; Math. Rev., 17, 130. Делзарт, Гёталс, Мак-Вильямс (Delsarte P., Coeth-

a I s I. M., M a с W i 11 i a m s F. J.), [1968] Неопубликованная работа. Джекобе, Берлекэмп (Jacobs I. М., Berlekamp E. R.),

[1967] A Lower Bound to the Distribution of Computation for Sequential

Decoding, IEEE Trans. Inform. Theory, IT13, 167-174. (Русский перевод: Джекобе И., Б е р л е к а м п И., Нижняя граница распределения количества вычислений для последовательного декодирования, сб. «Некоторые вопросы теории кодирования», «Мир», М., 1970, 230-248.)

Джелинек (Jelinek F.), [1968] Probabilistic Information Theory: Discrete and Memoryless Models, McGraw-Hill Book Company, New York.

Джиллайс (Gillies D. В.), [1964] Three New Mersenne Primes and a Statistical Theory, Math. Computation, 18, 93-97; Math. Rev., 28, 2990.

Джонсон (Johnsons. M.), [1962] A New Upper Bound for Error-correcting Codes, IEEE Trans. Inform. Theory, ITS, 203-207; Math. Rev., 25, 1067. (Русский перевод: Джонсон С, Новая верхняя граница для кодов, исправляющих ошибки. Теория кодирования, «Мир», М., 1964, 208-224.)

-, [1963] Improved Asymptotic Bounds for Error-correcting Codes, IEEE

Trans. Inform. Theory, 9, 198-205; Math. Rev., 29, 1089.

Джулин (Julin D.), [1965] Two Improved Block Codes, IEEE Trans. Inform. Theory, ITll, 459.

Диксон (Dickson L. E.), [1901] Linear Groups with an Exposition of the Calois Field Theory, Leipzig; republished in paperback by Dover Publications, New York, 1958.

Дэйкин (Daykin D. E.), [1960] Distribution ot Bordered Persymmetric Matrices in a Finite Field, /. Reine Angew. Math., 203, 47-54; Math. Rev., 22, 3734.

-, [1965] Generation of Irreducible Polynomials over a Finite Field, Amer.

Math. Monthly, 72, 646-648.

Заремба (Zaremba S. K.), [1952] Covering Problems Concerning Abelaln Groups, /. Land. Math. Soc, 27, 242-246; Math. Rev., 13, 817.

Зив (Z i V J.), [1962] Coding and Decoding for Time-discrete Amplitude Continuous Memoryless Channels, IEEE Trans. Inform. Theory, IT8, S199- S205.

-, [1966] Further Results on the Asymptotic Complexity of an Iterative

Coding Scheme, IEEE Trans. Inform. Theory, IT12, 168-171. -, [1967] Asymptotic Performance and Complexity of a Coding Scheme for

Memoryless Channels, IEEE Trans. Inform. Theory, IT13, 359. Зингер (Singer J.), [1938] A Theorem in Finite Projective Geometry and

Some Applications to Number Theory, Trans. Amer. Math. Soc, 43, 377-

385.

Казами (Kasami Т.), [1968] Weight Distribution of BCH Codes, chap. 20 in R. C. Rose and T. A. Dowling (eds.). Proceedings of the Conference on Combinatorial Mathematics and Its Applications (April 10-14, 1967), The University of North Carolina Press, Chapel Hill, N.C.

-, Лин, nHTejpcoH (Lin S., Peterson W. W.), [1966] Some

Results on Weight Distributions of BCH Codes, IEEE Trans. Inform. Theory, IT12, 274.

-, -,-, [1967a] Some Results on Cyclic Codes which are Invariant

under the Affine Group and their Applications, Inform. Control, 11, 475-496.

[1967b] Weight Distribution of BCH Codes, /. Inst.

Commun. Eng. Japan, September.

{I968a] Weight

неопубликованное сообщение.

[1968b] New

Distribution of Certain Cyclic Codes,

Generalizations of the Reed-MuUer Codes,

Part I: Primitive Codes, IEEE Trans. Inform. Theory 14, 189-198.

[1968c] Polynomial Codes, IEEE Trans. Inform. Theory,

14, 809-814.

[1968d] Futher Results on Generalized Reed-MuUer

Codes, /. Inst. Commun. Eng. Japan, 5IC, 98-105.



Калаби, Мирвааиес (Calabi L., Myrvaagnes е.), [1964] On the Minimal Weight of Binary Group Codes, IEEE Trans. Inform. Theory, ITIO, 385-387.

Камьон (Camion P.), [1966] Codes correcteurs derreurs. Rev. CETHEDEC, 3 (num. spec).

-, [1968] A Proof of Some Properties of Reed-MuUer Codes by Means of the

Normal Basis Theorem, chap. 22 in R. C. Bose and T. A. Dowling (eds.). Proceedings of the Conference on Combinatorial Mathematics and Applications (April 10-14, 1967), The University of Carolina Press, Chapel Hill, N.C, Math. Rev., 35, 5291.

Каннингем, Вудэл (Cunningham A. J., Woodal H. J.), [1925] Factorizations of (yn 1), F. Hodgson, London.

Карлин (Karlin M.), [1969] New Binary Coding Results by Circulants, IEEE, Trans. Inform. Theory, IT15 № 1, 81-92.

Карлиц (Carlitz L.), [1953] A Theorem of Stickelberger, Math. Scand., 1, 82-84; Math. Rev., 15, 13.

-, Ходжес (Hodges J. H.), [1965a] Distribution of Bordered Symmetric, Skew and Hermitian Matrices in a Finite Field, /. Reine Angew. Math., 195, 192-201; Math: Rev., 17, 828.

-, -, [1956 b] Distribution of Matrices in a Finite Field, iaci/tc/. Maife.,

6, 225-230; Math. Rev., 18, 554.

Кац (К a с М.), [1959] Statistical Independence in Probability, Analysis and Number Theory, Carus Monograph. No. 12, Mathematical Association of America and John Wiley &, Sons, New York; Math Rev., 22, 996. (Русский перевод: Кац М., Статистическая независимость в теории вероятностей, анализе и теории чисел, ИЛ, М., 1963.)

Кнут (Knuth D. е.), [1968] The Art of Computer Programming, i-VII, Addison - Wesley Publishing Company, Reading, Mass.

К о к (Cocke J.), [1959] Losseless symbol coding with nonprimes, IEEE Trans. Inform. Theory, 5, 33-34; Math. Rev., 22, 13355.

Кохен (Cohen E. L.), [1964] A Note on Perfect Double Error-correcting Codes on q Symbols, Inform. Control, 7, 381-384; Math. Rev., 29, 5656.

Ландсберг (Landsberg G.), [1893] Uber eine Anzahlbestimmung und eine damit zusammenhangende Reihe, J. Reine Angew. Math., Ill, 87-88.

Леви (Levy J.), [1964] Capabilities of Parity-check Codes for Nonprime Alphabets, M.S. thesis. Electrical Engineering Department, Massachusetts Institute of Technology.

Лехмер (Lehmer E.), [1936] On the Magnitude of the Coefficients of the Cyclotomic Polynomial, Bull. Amer. Math. Soc., 42, 389-392.

Ли (Lee C. Y.), [1958] Some Propereties of Nonbinary Error-correcting Codes, IEEE Trans. Inform. Theory, IT4, 77-82; Math. Rev., 22, 13353.

Лин (Lin S.), [1968] Some Codes Which Are Invariant under a Transitive Permutation and Their Connection with Balanced Incomplete Group Block Desing, chap. 24 in R. C. Bose and T. A. Dowling (eds.). Proceedings of the Conference on Combinatorial Mathematics and Its Applications (April 10-14, 1967), The University of North Carolina Press, Chapel Hill, N.C

Логан (Logan B. F.), [1967] Частное сообщение.

Ллойд (Lloyd S. P.), [19571 Binary Block Coding, Bell System Tech. J.,

36, 517-535; Math. Rev., 19, 465. Лукас (Lucas E.), [1878] Sur Les congruences des nombres euleriennes

et des coefficients differentiels des functions trigonometriques, suivant

un-module premier. Bull. Soc. Math. France, 6, 49-54. Мак-Вильямс (MacWilliams F. J.), [1963] A Theorem on the

Distribution of Weights in a Systematic Code, Bell System Tech. /., 42,

79-94; Math. Rev., 26, 7462.

-, [1964] Permutation Decoding of Systematic Codes, Bell. System Tech. /.,

43, 485-505. (Русский перевод: М a к-В и л ь я м с Дж., Перестановочное декодирование систематических кодов, Кибернетический сборник, новая серия, вып. 1, «Мир», М., 1966)

-, [1965] The Structure and Properties of Binary Cyclic Alphabets, Bell

System Tech. J., 44, 303-332. (Русский перевод: Мак-Вильямс Дж., Структура и свойства бинарных циклических алфавитов. Кибернетический сборник, новая серия, вып. 4, «Мир», М., 1967, 7-42.)

-, [1968], Codes and Ideals in Group Algebras, chap. 18 in R. C. Bose and

T. A. Dowling (eds.). Proceedings of the Conference on Combinatorial Mathematics and its Applications (April 10-14, 1967), The University of North Carolina Press, Chapel Hill, N.C.

-, [1970] Orthogonal Circulant Matrices over Finite Fields, /. Combinatorial

Theory, in press.

-, Манн даапп Н. В.), [1968] On the p-rank of the Design Matrix of

Difference Set, Inform. Control, 12, 474-488.

Мак-Дональд (MacDonald J. E.), [1960] Design Methods for Maximum Minimum-distance Error-correcting Codes, IBM J. Res. Develop., 4, 43-57; Math. Rev., 22, 1471.

Манкой (McCoy N. H.), [1965] The Theory of Numbers, The Macmillan Company, New York; Math. Rev., 32, 78.

Маллер (MullerD. E.), [1954] Application of Boolean Algebra to Switching Circuit Design and to Error Detection, IEEE Computers, EC3, 6-12; Math. Rev., 16, 99.

Мандельброт (Mandelbret В.), [1965] Self-similar Error Clusters

in Communication Systems and the Concept of Conditional Stationarity,

IEEE Trans. Commun. Tech., Com TI3, 71-90. Манн (Mann H. В.), [1962] On the Number of Information Symbols in Bose-

Chaudhuri Codes, Inform. Control, 5, 153-162; Math. Rev., 26, 4847. -, [1965] Addition Theorems, John Wiley & Sons, New York; Math. Rev.,

31, 5854.

-, [1967] Recent Advances in Difference Sets, Amer. Math. Monthly, 74,

229-235.

Месси (Massey J. L.), [1963] Treshold Decoding, The M. I. T. Press, Cambridge, Mass.; Math. Rev., 27, 4709. (Русский перевод: Meecu Дж., Пороговое декодирование, «Мир», М., 1964.)

-, [1964] Reversible Codes, Inform. Control, 7, 369-380; Math. Rev., 29,

5660.

-, [1965] Implementation of Burst-correcting Convolutional Codes, IEEE

Trans. Inform. Theory, ITll, 416-422.

-, [1969] Feedback Shift Register Synthesis and BCH Decoding, IEEE

Trans. Inform. Theory, IT15, 122-128.

Милн (Milne W. E.), [1949] Numerical Calculus, Princeton University Press, Princeton, N.J.; Math. Rev.; 10, 483.

Мэрш: (Marsh R. W.), [1957] Table of Irreducible Polynomials over GF(2) through Degree 19, U.S. Department of Commerce, Washington, D.C

Мэттсон, Ассмус (Mattson H. F., Assmus E. F. Jr.), [1964] Research Program to Extend the Theory of Weight Distribution and Related Problems for Cyclic Error-correcting Codes, Air Force Cambridge Res. Lab. Smn. Rept. 3.

-, Соломон (Solomon G.), [1961] A New Treatment of Bose -

Chaudhuri Codes, /. Soc. Indus. Appl. Math., 9, 654-669; Math. Rev., 24B, 1705 (Русский перевод: Мэттсон Г. Ф., Соломон Г., Новая трактовка кодов Боуза - Чоудхури, Теория кодирования, сборник переводов, «Мир», М., 1964, 7-29.)

Нейдлер (Nadler М.), [1962а] А 32-point п = 12, d = 5 Code, IEEE Trans. Inform. Theory, ITS, 58.




[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66] [67] [68] [69] [70] [71] [72] [73] [ 74 ] [75] [76] [77] [78]

0.0273