On Binary Cyclic Codes With Few Weights
- 1 January 2001
- book chapter
- Published by Springer Nature
- p. 251-275
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjectureIEEE Transactions on Information Theory, 2000
- Codes, Bent Functions and Permutations Suitable For DES-like CryptosystemsDesigns, Codes and Cryptography, 1998
- One-to-One Highly Nonlinear Power Functions on GF(2 n )Applicable Algebra in Engineering, Communication and Computing, 1998
- Non-BCH triple-error-correcting codesIEEE Transactions on Information Theory, 1996
- On the minimum distance of cyclic codesIEEE Transactions on Information Theory, 1986
- On the Preparata and Goethals codesIEEE Transactions on Information Theory, 1983
- A new lower bound for the minimum distance of a cyclic codeIEEE Transactions on Information Theory, 1983
- The solution to Beniamino Segre's problem I r,q , r=3, q=2 hGeometriae Dedicata, 1982
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codesInformation and Control, 1971
- On periodic sequences from GF(q)Journal of Combinatorial Theory, Series A, 1971