On the reconstruction of linear codes

Journal of Combinatorial Designs

Volumn 6, Issue 4, 1998, Pages 285-291

  Maynard, Philip ^a   Siemons, Johannes ^a  

^a UNIVERSITY OF EAST ANGLIA   (United Kingdom)

Author keywords

Linear codes; Reconstruction; Reconstruction index of permutation group; Residual codes

Indexed keywords

EID: 0038490494     PISSN: 10638539     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6610(1998)6:4<285::AID-JCD6>3.0.CO;2-B     Document Type: Article

References (8)

1. N. Alon, Y. Caro, I. Krasikov, and Y. Roditty, Combinatorial reconstruction problems J. Combin. Theory Ser. B 47, (1989), 153-161.
2. P. J. Cameron, "Some open problems on permutation groups," LMS Lecture Note Series 165, Groups, combinatorics and geometry, M. W. Liebeck and J. Sax (Editors), Cambridge University Press, 1990, pp. 340-350.
3. H. Lefmann, An extremal problem for Graham-Rothschild parameter words, Combinatorica 9(2), (1989), 153-160.
4. F. J. MacWilliams and N. J. A. Sloane, The theory of error correcting codes, North-Holland, 1977.
5. P. M. Maynard, On orbit reconstruction problems, UEA Thesis, 1996.
6. V. B. Mnukhin, The k-orbit reconstruction and the orbit algebra, Acta Appl. Math. 29, (1992), 83-117.
7. 2 n edges, J. Combin. Theory Ser. B 22, (1977), 281-283.
8. J. H. Van Lint, Introduction to coding theory, Springer-Verlag 1982.