On the existence of error-correcting pairs

Journal of Statistical Planning and Inference

Volumn 51, Issue 2, 1996, Pages 229-242

  Pellikaan, Ruud ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Algebraic geometric codes; Decoding; Error correcting pairs

Indexed keywords

EID: 0030147096     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/0378-3758(95)00088-7     Document Type: Article

References (11)

1. Duursma, I.M. (1993). Decoding codes from curves and cyclic codes, PhD. thesis, Eindhoven University of Technology.
2. Duursma, I.M. and R. Kötter (1994). Error-locating pairs for cyclic codes. IEEE Trans. Inform. Theory 40, 1108-1121.
3. Kötter, R (1992). A unified description of an error locating procedure for linear codes Proc. Algebraic and Combinatorial Coding Theory, Voneshta Voda, 1992, 113-117.
4. Mac Williams, F.J. and N.J.A. Sloane (1977). The Theory of Error-correcting Codes. North-Holland, Amsterdam.
5. Oberst, U. and A. Dür (1985) A constructive characterization of all optimal linear codes. In: Séminaìre d'Algèbre, Paul Dubreil et Marie-Paule Malliavin 1983-1984, Lecture Notes in Math. 1146 Springer, Berlin, 176-213.
6. Pellikaan, R. (1992). On decoding by error location and dependent sets of error positions. Discrete Math. 106/107 369-381.
7. Pellikaan, R. (1989). On a decoding algorithm for codes on maximal curves. IEEE Trans. Inform. Theory 35, 1228-1232.
8. Pellikaan R. and C. Kirfel (1993). The minimum distance of codes in an array coming from telescopic semigroups, preprint.
9. Pellikaan, R. B.-Z. Shen and G.J.M. van Wee (1991). Which linear codes are algebraic-geometric ?, IEEE Trans. Inform. Theory. 37, 583-602.
10. van Lint, J.H. and R.M. Wilson (1986) On the minimum distance of cyclic codes. IEEE Trans. Inform. Theory 32, 23-40.
11. g, for q ≥ 16, IEEE Trans. Inform. Theory 36, 1461-1463.