Algebraically Punctured Cyclic Codes
暂无分享,去创建一个
We present a new class of optimal (n, k) group codes over the general finito field GF(q), q, a prime power, which are obtained by systematically deleting or puncturing certain coordinates of the maximal length shift register (qk − 1, k) code. The algorithm for puncturing is algebraic in that the coordinates deleted form subgroups of the additive group of the (qk − 1) roots of unity, or cosets of the multiplicative group of the (qk − 1) roots of unity, modulo the multiplicative group of GF(q). The specific algebraic nature of this puncturing procedure for any particular k yields codes of length n greater than qk−1. Optimality is proven by generalizing the Griesmer Bound on group codes. Encoding and decoding procedures are presented for this class of codes.
[1] Jessie Macwilliams. Error-correcting codes for multiple-level transmission , 1961 .
[2] Morris Plotkin,et al. Binary codes with specified minimum distance , 1960, IRE Trans. Inf. Theory.
[3] James H. Griesmer,et al. A Bound for Error-Correcting Codes , 1960, IBM J. Res. Dev..
[4] J. J. Stiffler,et al. Punctured systematic cyclic coder. , 1964 .
[5] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .