A note on constant weight cyclic codes
Harry T. Hsu, John E. Olson
Abstract
Harry T. Hsu, John E. Olson
Abstract
In this paper we show that the dual code of a g-ary Hamming single error-correcting code is a constant weight cyclic code with weight q(m-1). We give, as a consequence, a very simple alternative derivation of the weight enumerator formula for the q-ary Hamming single error-correcting code. We show also that a binary cyclic equidistant code can be derived from this dual code
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we show that the dual code of a g-ary Hamming single error-correcting code is a constant weight cyclic code with weight q(m-1). We give, as a consequence, a very simple alternative derivation of the weight enumerator formula for the q-ary Hamming single error-correcting code. We show also that a binary cyclic equidistant code can be derived from this dual code
Key concepts: Cyclic code, Constant-weight code, Hamming code, Hamming bound, Constant (computer programming), Code (set theory), Mathematics, Polynomial code