Конечные поля. Том 1 - Лидл Р.
ISBN 5-03-000065-8
Скачать (прямая ссылка):
(1935)Щ
[31 Uber die irreduzibilifaf ganzzahliger Poiynome nach einem
Prinizahtmadtitiy J, reine angew. Math. 175, 209-220 (1936), ' "Gf
PETTOROSS1 A. f 1 ] Derivation of an О (к2 log я) algorithm for computing
ordep#§ Fibonacci numbers from the О (k:i log я) matrix multiplication
method, forrn. Process. Lett. 11, no. 4-5, 172 179(1980). vjf
PETTOROSS1 A.. BURSTALL R. M. [If Deriving very efficient algorithms fori
evaluating linear recurrence relations using the program ИашГогпшНшЩ
technique, Acta Informatics 18, 181-206(1982).
P1CKERT G. fl] Projektive Ebeoen, 2nd ed., Springer-Verlag, Berlin -
Hejdejuf
berg-New York, 1975. Д
P1EPER H. [I] Variationen uber ein zahlentheoretisehes Thema von Carl
Fri§|| drich Gauss, Birkhauser-Verlag, Basel, 1978. Ь'УЦ
PILZ G. fl] Near Rings: The Theory and'Its Applications, North-Holland,
Afpwf sterdam, 1977.
PIUMA С. M, [1] Inforno ad una congruenza di modulo primo, Ann. Mat.
Purif
Appl. (2) 11, 237-245 (1883).
PIZZARELLO G. f 1 j Sui pollnomi in я indeterminate sopra un campo
finito, Ricerca (Napoli) (4) 28, no. 3, 3-7 (1977). - ; if;
PLESKEN W. [11 Counting with groups and rings. J. reine angew. Math.
334)* 40-68 (1982).
PLESS V. fi ] Power moment identities on weight distributions in error
correctin||:J| codes, Information and Control 6, 147 152 (1963).
[2] On the invariants of a vector subspace of л vector space over a
field of chaU|
nieteristic two, Proc. Amer, Math. Soc, 16, 1062 - 1067 (1965).
PLOTK1N M. [1] Binary codes with specified minimum distances, [RE ТгащД||
Information Theory IT-6, 445-450 (1960). [Имеется перевод: ПЛОТ КИН ШЩ
Двоичные коды с заданным минимальным расстоянием. - В кн.;
Кибернетический сборник, вып. 7. - М.; ИЛ, 1963, с. 60-73,]
POCKLINGION Н. С. fl 1 The direct solution of the quadratic and cubic
bino-)| mial congruences with prime moduli, Proc. Cambridge Philos. Soc.
16. 57-59 (1917).
121 Quadratic and higher reciprocity of modular polynomials, Proc.
Cambrid Philos. Soc. 40, 212-214 (1944).
POHL1G S. C., HELLMAN М. E. [1] An improved algorithm for computing
garithms over GF (p) and its cryptographic significance, IEEE Trans.
.Ш $
Ь -**4
Ц,
1%
X
• ••v ?
Литература
765
formation Theory IT-24, 106-110 (1978).
POLKJNGHORN F., Jr. [I j Decoding of double and triple error correcting
Bose- Ctiaudhuri codes, IEEE Trans. Information Theory IT-(2, 480-481
(1966). POLLARD J. M. |lj The fast Fourier transform in a Finite field,
Math. Comp. 25, .365-374 (1971). [Имеется перевод: ПОЛЛАРД ДЖ. М. Быстрое
преобразование Фурье в конечном поле. - В кн.: Макклеллан Дж. X., Рейдер
Ч. М. Применение теории чисел в цифровой обработке сигналов. - М.: Радио
и связь, 1983, с. 147-155.]
12J Implementation of number-theoretic transforms, Electron. Lett. 12.
378- 379 (1976).
f3j Monte Carlo methods for index computation (mod /?), Math. Comp. 32.
918- 924 (1978).
P6LYA G. 11] Uber d ie Verteilung der quadratischen Reste und Nichtreste,
Gottinger Nachr. 19(8, 21-29.
POLYA G., SZEGO G. [1 ] Aufgaben und Lehrsatze aus der Analysis. H,
Springer,
Berlin, f925. [Имеется перевод; ПОЛИА Г., СЕГЕ Г. Задачи и теоремы
из анализа, ч. 2. -М.: Наука, 1978, |
POPOV1C1 С. Р. [1} Целочисленные полиномы, неприводимые по модулю р,
Rev. Math. Pures Appl. 4, 369-379 (1959).
[21 Irreducible polinomials modulo p (Romanian), Acad. R. P. Romfne FiL
Iasi Stud. Cere. Sti. Mat. 11, 13-23 (1960).
* %
PORTER A. D. 11] Systems of bilinear and quadratic equations in a finite
field, Arm. Mat. Pura Appl. (4) 68 , 21-29 (1965).
[2] Systems of one quadratic and two bilinear equations in a finite
Field, Pub!.
Math. Debrecen 13, 117-121 (1966).
(-3J Pairs of bilinear and quadratic equations in a finite field.
Monatsh. Math.
70, 155-160 (1966), f4] Special equations in a finite field, Math. Nachr.
32, 277-279 (1966).
[5] Triiinear equations in a Finite field, Atti Accad. Naz. Lincei Rend.
Cl. Sci. Fis. Mat. Natur. (8)40, 361-365 (1966).
[6] Pairs of bilinear equations in a finite field, Canad. J. Math. 18,
561-565
(1966).
[7 Some systems of equations in a finite field. Math. Z. 100, 141-145
(1967). [8 Orthogonal similarity for skew matrices in GF (g), Atti.
Accad. Naz. Lincei Rend. Cl. Sci. FIs. Mat. Naiur. (8) 42, 757-762
(1967).
[9J Generalized quadratic forms in GF (q), Arch. Math. 19 , 615 620
(1968),
[10] The matric equation AXi ... Xa~B, Atti Accad, Naz. Lincei Rend. Cl.
Sci. Fis. Mat. Natur. (8) 44, 727-732 (1968).
[11] Simultaneous equations in a finite field, Publ. Math, Debrecen (6,99
-110(1969).
112] Some partitions of a skew matrix, Ann. Mat. Рига Appl. (4)82, 115
120
(1969).
[13] Orthogonal similarity in я finite field, Math. Nachr. 40, 327-331
(1969).
[14] Generalized bilinear forms in a finite field, Duke Math. J. 37, 55-
60 (1970).
[15] Systems of four equations with a matric application in a finite
field, Portugal. Math, 31, 121 - 131 (1972).
[16] A matrix form of an exponential sum, Rend. Mat. (6) 5, 803-818
