DocumentCode :
991719
Title :
Chain of Separable Binary Goppa Codes and Their Minimal Distance
Author :
Bezzateev, Sergey ; Shekhunova, Natalia
Author_Institution :
Dept. of Inf. Syst. & Security, St. Petersburg State Univ. of Airspace Instrum., St. Petersburg
Volume :
54
Issue :
12
fYear :
2008
Firstpage :
5773
Lastpage :
5778
Abstract :
It is shown that subclasses of separable binary Goppa codes, Gamma(L,G) - codes, with L={alpha isin GF(22l):G(alpha) ne 0 } and special Goppa polynomials G(x) can be presented as a chain of embedded and equivalent codes. The true minimal distance has been obtained for all codes of the chain.
Keywords :
Goppa codes; binary codes; polynomials; Goppa Codes; Goppa polynomials; binary codes; embedded codes; equivalent codes; minimal distance; separable codes; Binary codes; Equations; Information security; Information systems; Instruments; Kernel; Parity check codes; Goppa codes; minimal distance of separable binary codes; quasi-cyclic Goppa codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2008.2006442
Filename :
4675743
Link To Document :
بازگشت