DocumentCode
314076
Title
Quasi-cyclic binary Goppa codes
Author
Blanchet, Francis ; Bommier, Grégoire
Author_Institution
Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
504
Abstract
We give here a necessary and sufficient condition for a binary Goppa code to be quasi-cyclic, a sufficient condition easier to check, a partial converse and some specific forms for quasi-cyclic Goppa codes
Keywords
Goppa codes; binary sequences; cyclic codes; binary Goppa codes; necessary condition; partial converse; quasi-cyclic Goppa codes; sufficient condition; Binary codes; Computer aided software engineering; Hamming weight; Polynomials; Sufficient conditions; Virtual colonoscopy;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613441
Filename
613441
Link To Document