Конечные поля. Том 1 - Лидл Р.
ISBN 5-03-000065-8
Скачать (прямая ссылка):
153-^ii 158 (1978). L ug
LOXTON J. H., SMITH R. A. fl] On Hua's estimate for exponential sum&pf J,
London Math. Soc. (2) 26, 15-20 (1982). ? j
f2] Estimates for multiple exponential sums, J. Austral. Math. Soc. Ser.
A 3$v;| 125-134 (1982). !
LURELSK1 S. fl] Zur Theorie der hoheren Kongruenzen, J. reine angew.
MaffiLyl 162, 63-68 (1930). t ; |
f2] Zur Reduzihilitat von Poiynomen in der Kongruenztheorie, Acta Arith.
HI
169-183 (1936). Щ
[3] Uber zwei Wegnersche Satze, Izv. Akad. Nauk SSSR Ser. Mat. 5, 395-
3i$l
(1941). -gj
LUBKIN S. fl] On a conjecture ol Andre Weil, Amer, J. Math. 89, 443-54%f
(1967). "4
:.'L"
Литература
751
12] A p-adic ргооГ оГ Weil's conjectures, Ann of Math, (2) 87, 105-194,
195 -255 (1968).
|3j A result on the Weil zeta function, Trans. Amer, Math. Soc. 139, 297-
300 (i 969).
14 ] Finite generations of lifted p-adic homology with compact supports.
Generalization оГ the Weil conjectures to singular, noncomplete algebraic
varieties, Algebraic Geometry (Copenhagen, 1978), pp. 317-373, Lecture
Notes in Math., vol. 732, Springer-Verlag, Berlin-Heidelberg-New York,
1979.
{5 f Finite generation of lifted p-adic homology with compact
supports. Generalization оГ the Weil conjectures to singular,
noncomplete algebraic varieties,
.1. Number Theory 11, 412-464 (1979).
LUCAS E. [1] Theorie des Tonctions numeriques simplement periodiques,
Amer, J. Math. 1, 184-240, 289-321 (1878).
j2 j Theorie des nombres, Gauthier-Viliars, Paris, 1891,
LUCKY R, WG SALZ J., WELDON E. J., Jr. fl ] Principles оГ Data
Communication, McGraw-Hill, New York, 1968.
f.Uii J, [1 ] On the representation оГ vector spaces as a finite union оГ
subspaces, Acta Math. Acad. .Sci, Hungar. 23, 341-342 (1972).
LL NEBURG H, [1] Transitive Erweiterungen endlicher
Permutatiorisgruppen,
Lecture Notes in Math., vol. 84, Springer-Verlag, Berlin-
Heidelberg-New
York, 1969.
121 Galoisfelder, Kreisteilungskorper und Schieberegisterrolgen,
Bibllographis* ches fnstitut, Mannheim, 1979.
LUNEBURG H., PLAL'MANN P, [1] Die Funktionalgleicliung vori Golab und
Schinze! in Galoisfeldern, Arch. Math. 28, 55-59 (1977).
I UNNON W. F., PLEASANTS P, A. B., STEPHENS N, M. [If Arilhmetic
properties of Beil numbers to a composite modulus, Acta Arith. 35, 1-16
(1979).
MACCL.UER C. R, [11 On a conjecture of Davenport and Lewis concerning
exceptional polynomials, Acta Arith. 12, 289-299 (1967).
MACDOUGAL). J. A, (lj Bivectors over a finite field, Canad. Math.
Bull."24.' 489-490 (1981).
MACNE1SH H. F, fl ] Euler squares. Ann. оГ Math. (2) 23, 221 227
(1922),
MACWILLIAMS F. J, [If A theorem on the dislrihulion of weights in a
systematic code, Bell System Tech. J, 42, 79-94 (1963).
|2] The structure and properties of binary cyclic alphabets, Bell System
Tech.
2 44. 303-332 (1965), [Имеется перевод: МАК-ВИЛЬЯМС ДЖ, Структура и
свойства бинарных циклических алфавитов. - В ки,: Киберн. сборник, нов,
сер,, вып. 4. -М.: Мир, 1967, с. 7-42, j
|3f Orthogonal matrices over Tinite fields, Amer. Math. Monthly 76
152-164
(1969),
|4 ] Orthogonal drcuhmt matrices over finite fields, and how to find
them, J , Combinatorial Theory 10, I 17 (1971).
MACWILLIAMS F. J., MANN H. B, [1 | On the p-rank оГ the design
matrix
оГ a difference set, Information and Control 12, 474-488 (1968),
MACWILLIAMS F. J , ODLYZKO A. M. fl) Pelikan's conjecture and cyclotomic
cosets, J. Combinatorial Theory Ser. A 22, 110 - 114 (1977).
MACWILLIAMS F, J., SEERY J. [1] The wight distributions of some
minima!
cyclic codes, fEEE Trans. Information Theory IT-27, 796-806 (1981).
MACWILLIAMS F. J-, SLOANE N. J. A. [11 Pseudo-random sequences and
arrays, Proc, IEEE 64, 1715-1729 (1976),
12] The Theory of Error-Correcting Codes, North-Holland, Amsterdam,
1977,
[Имеется перевод: МАК-ВИЛЬЯМС Ф, ДЖ., СЛОЭН Н. ДЖ, А, Теория
кодов, исправляющих ошибки, - М.: Связь, 1979. J
MACWILLIAMS F. JSLOANE N. J. A.. GOETHALS J.-M. ]! } The Mac-Wiiliams
identities for nonlinear codes. Bell System Tech, J. 51. 803 819
(1972),
'Щ
.Щ
ч
ш
Щ
•с? 5
• :М$
MADDEN D, J, {1J Polynomials and primitive roots in finite fields, Л,
Numbifel Theory 13, 499 514 (1981).
MA1LLET E. [1] Bes conditions pour que Fecheile d'une suite recur rente
irreductible. Nouv. Ann. Math, (3) 14, 152-157, 197-206 (1895).
MAMANGAK.1S S. E, fl] Remarks on the Fibonacci series modulo m, Amer.
МаЙЙ
Monthly 68, 648 649 (1961).
MANDELBAUM D jlj On decoding of Reed-Solomon codes, IEEE Tran&jl
Information Theory IT-17, 707-712 (1971), |L
[2] Some results in decoding of certain maxi null-distance and БОН codes,
Infor-il mation and Control 20, 232-243 (1972). *,;f
13 j A method tor decoding of generalized Goppa codes, IEEE Trans.
Information!
Theory IT-23, 137-140 (1977),' Addition, ibid, IT-24, 268 (1978). '
-4
MANN H. B. (I) The construction of orthogonal Latin squares, Ami. Math. S
tist. 13, 418-423 (1942).
[2] Analysis and Design of Experiments, Dover, New York, 1949,
