New linear codes derived from binary cyclic codes of length 151

IEE Proceedings: Communications

Volumn 153, Issue 5, 2006, Pages 581-585

  Tjhai, C ^a   Tomlinson, M ^a   Grassl, M ^b   Horan, R ^a   Ahmed, M ^a   Ambroze, M ^a  

^a UNIVERSITY OF PLYMOUTH   (United Kingdom)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CYCLIC CODES; LINEAR CODES; NESTED CHAIN;

DATABASE SYSTEMS; LINEAR SYSTEMS; PARAMETER ESTIMATION;

BINARY CODES;

EID: 33750015520     PISSN: 13502425     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-com:20050560     Document Type: Article

References (17)

1. Brouwer, A.E.: ' Bounds on the size of linear codes ', Pless, V.S., Huffman, W.C., Handbook of coding theory, (Elsevier, North Holland, 1998)
2. Grassl, M.: ' New binary codes from a chain of cyclic codes ', IEEE Trans. Inf. Theory, 2001, 47, p. 1178-1181 10.1109/18.915676 0018-9448
3. Sloane, N.J., Reddy, S.M., and Chen, C.L.: ' New binary codes ', IEEE Trans. Inf. Theory, 1972, 18, p. 503-510 10.1109/TIT.1972.1054833 0018-9448
4. MacWilliams, F.J., and Sloane, N.J.A.: ' The theory of error-correcting codes ', (North Holland, 1977), ISBN 0 444 85193 3
5. Bierbrauer, J., and Edel, Y.: ' Extending and lengthening BCH-codes ', Finite Fields Appl., 1997, 3, p. 314-333 10.1006/ffta.1997.0188 1071-5797
6. Grassl, M.: ' Searching for good linear codes ', Bosma, W., Cannon, J., Discovering mathematics with MAGMA, (Springer, Berlin, 2006)
7. Alltop, W.O.: ' A method of extending binary linear codes ', IEEE Trans. Inf. Theory, 1984, 30, p. 871-872 10.1109/TIT.1984.1056973 0018-9448
8. Bosma, W., Cannon, J.J., and Playoust, C.: ' The Magma algebra system I: the user language ', J. Symb. Comput., 1997, 24, p. 235-266 10.1006/jsco.1996. 0125 0747-7171
9. Chen, C.L.: ' Computer results on the minimum distance of some binary cyclic codes ', IEEE Trans. Inf. Theory, 1970, 16, p. 359-360 10.1109/TIT.1970.1054452 0018-9448
10. Promhouse, G., and Tavares, S.E.: ' The minimum distance of all binary cyclic codes of odd lengths form 69 to 99 ', IEEE Trans. Inf. Theory, 1978, 24, p. 438-442 0018-9448
11. Coppersmith, D., and Seroussi, G.: ' On the minimum distance of some quadratic residue codes ', IEEE Trans. Inf. Theory, 1984, 30, p. 407-411 10.1109/TIT.1984.1056861 0018-9448
12. Bitner, J.R., Ehrlich, G., and Reinglod, E.M.: ' Efficient generation of the binary reflected Gray code and its applications ', Commun. ACM, 1976, 19, p. 517-521 10.1145/360336.360343 0001-0782
13. Knuth, D.E.: 'The art of computer programming, vol. 4, fascicle 3: Generating all combinations and partitions (Addison-Wesley Professional, 2005)
14. Van Dijk, M., Egner, S., Greferath, M., and Wassermann, A.: ' On two doubly even self-dual binary codes of length 160 and minumum weight 24 ', IEEE Trans. Inf. Theory, 2005, 51, p. 408-411 10.1109/TIT.2004.839535 0018-9448
15. Fossorier, M.: ' Reliability-based soft-decision decoding for linear block codes ', Lin, S., Costello, D.J., Error control coding, (Pearson Education, Inc, 2004), 2nd edn.
16. Shannon, C.E.: ' Probability of error for optimal codes in a gaussian channel ', Bell Syst. Tech. J., 1959, 38, p. 611-656 0005-8580
17. ' Code performance as a function of block size ', May, 1998, http://tmo.jpl.nasa.gov/progress_report/42-133/133K.pdf, accessed 14 July 2006