Access the full text.
Sign up today, get DeepDyve free for 14 days.
A.K. Pulatov (1974)
Diskretnyi analiz
C. Liu, B. Ong, Greg Ruth (1973)
A construction scheme for linear and non-linear codesDiscret. Math., 4
J. Borges, K.T. Phelps, J. Rifà, V.A. Zinoviev (2003)
On Z 4-linear Preparata-like and Kerdock-like CodesIEEE Trans. Inform. Theory, 49
J. Borges, J. Rifà (1999)
A characterization of 1-perfect additive codesIEEE Trans. Inf. Theory, 45
F. MacWilliams, N. Sloane (1977)
The Theory of Error-Correcting Codes
D. Krotov (2001)
Z4-linear Hadamard and extended perfect codesElectron. Notes Discret. Math., 6
J. Borges, C. Fernandez, K. Phelps (2005)
Quaternary Reed-Muller codesIEEE Transactions on Information Theory, 51
A. Hammons, Jr., P. Kumar, A. Calderbank, N. Sloane, P. Solé (1994)
The Z4-linearity of Kerdock, Preparata, Goethals, and related codesIEEE Trans. Inf. Theory, 40
K. Phelps (1986)
Dual product constructions of Reed-Muller type codesIEEE Trans. Inf. Theory, 32
A.S. Kuz’min, A.A. Nechaev (1992)
Construction of Noise-Resistant Codes by Means of Linear Recurrences over Galois RingsUspekhi Mat. Nauk, 47
N.N. Tokareva (2005)
Representation of ℤ4-linear Preparata Codes Using Vector FieldsProbl. Peredachi Inf., 41
X.-D. Hou, J.T. Lahtonen, S. Koponen (1998)
The Reed-Muller Code R(r, m) Is Not Z 4-linear for 3 ≤ r ≤ m − 2IEEE Trans. Inform. Theory, 44
A. Calderbank, P. Cameron, W. Kantor, JJ Seidel (1997)
Z4‐Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line‐SetsProceedings of the London Mathematical Society, 75
A.A. Nechaev, A.S. Kuz’min (1996)
Proc. 5th Int. Workshop on Algebraic and Combinatorial Coding Theory
Jaume Pujol, J. Rifà (1997)
Additive Reed-Muller codesProceedings of IEEE International Symposium on Information Theory
Z. Wan, C. Wan (1997)
Quaternary Codes
J. Borges, K. Phelps, J. Rifà, V. Zinoviev (2003)
On Z4-linear Preparata-like and Kerdock-like codeIEEE Trans. Inf. Theory, 49
F.I. Solov’eva (1981)
Metody diskretnogo analiza v izuchenii bulevykh funktsii i grafov
D. Krotov (2007)
Z4-Linear Perfect CodesArXiv, abs/0710.0198
A. Kuzmin, A. Nechaev (1992)
Construction of noise-resistant codes by means of linear recurrences over Galois ringsRussian Mathematical Surveys, 47
J. Borges, C. Fernández-Córdoba, K. Phelps (2008)
ZRM CodesIEEE Transactions on Information Theory, 54
A. Nechaev (1989)
Kerdock code in a cyclic form, 1
N. Tokareva (2005)
Representation of ℤ4-Linear Preparata Codes Using Vector FieldsProblems of Information Transmission, 41
M. Mollard (1986)
A generalized parity function and its use in the construction of perfect codesSiam Journal on Algebraic and Discrete Methods, 7
Xiang-dong Hou, J. Lahtonen, Sami Koponen (1998)
The Reed-Muller Code R(r, m) Is Not Z4-Linear for 3 <= r <= m-2IEEE Trans. Inf. Theory, 44
For any pair of integers r and m, 0 ≤ r ≤ m, we construct a class of quaternary linear codes whose binary images under the Gray map are codes with the parameters of the classical rth-order Reed-Muller code RM(r, m).
Problems of Information Transmission – Springer Journals
Published: Apr 20, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.