DocumentCode
918386
Title
Number of information symbols in polynomial codes
Author
Lin, Shu
Volume
18
Issue
6
fYear
1972
fDate
11/1/1972 12:00:00 AM
Firstpage
785
Lastpage
794
Abstract
Polynomial codes and their dual codes as introduced by Kasami, Lin, and Peterson have considerable algebraic and geometric structure. It has been shown that these codes contain many well-known classes of cyclic codes as subclasses, such as BCH codes, projective geometry codes (PG codes), Euclidean geometry codes (EG codes), and generalized Reed-Muller codes (GRM codes). In this paper, combinatorial expressions for the number of information symbols and parity-check symbols in polynomial codes are derived. The results are applied to two important subclasses of codes, the PG codes and EG codes.
Keywords
Polynomial codes; Cities and towns; Electrons; Geometry; Notice of Violation; Parity check codes; Polynomials; Shift registers; Virtual manufacturing; Welding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1972.1054900
Filename
1054900
Link To Document