Covering radius Of RM(1,9) In RM(3,9)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 514 LNCS, Issue , 1991, Pages 51-59

  Langevin, Philippe ^a  

^a UNIVERSITÉ DE TOULON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; FORWARD ERROR CORRECTION; FOURIER ANALYSIS;

COVERING RADIUS; FIRST ORDER; FOURIER COEFFICIENTS; REED-MULLER CODES;

CODES (SYMBOLS);

EID: 84985981551     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54303-1_117     Document Type: Conference Paper

References (11)

1. O. S. Rothaus, On “bent” Functions, J.C.T. 20 (1976), 300-305.
2. E. Berlekamp and L.R. Welch, Weigth distributions of the cosets of the (32,6) Reed-Muller code, IEEE T. I. T., vol. IT-18 (1972), 203-207.
3. T. Helleseth, T. Klove, and J. Mykkelveit, On the covering radius of binary codes, IEEE T.I.T. vol. IT-24 (1978), 627-628.
4. J. Mykkelveit, The covering radius of the (128,8) Reed-Muller code is 56. IEEE T.I.T. vol-26 (1980) 359-362.
5. N.J. Patterson and D.H. Wiedemann, The covering radius of the (215,16) Reed-Muller code is at least 16276, IEEE T.I.T. vol IT-29 (1983) 354-356.
6. J. Constantin, B. Courteau and J. Wolfmann, Numerical experiments related to the covering radius of some first order Reed-Muller codes.
7. F.J.S. Mac Williams and N.J.A. Sloane, The theory of error correcting codes, North Holland.
8. G.D. Cohen, M.G. Karpovsky, H.F. Mattson, Jr. and J.R. Schatz Covering radius-Survey and Recent Results IEEE T.I.T. vol-31 (1985), (328-344).
9. R.A. Brualdi and V.S. Pless, Orphans of the first order Reed-Muller codes. IEEE T.I.T., vol I.T-18 (1972), (203-207).
10. R.A. Brualdi,N. Cai, and V.S. Pless, Orphan Structure of the first order Reed-Muller codes.
11. J.R Joly, Equations et variétés algébriques sur un corps fini in L’enseignement des mathématiques, t.XIX, fasc 1-2.