Abstract
Sufficient conditions for the construction of a two-weight cyclic code by means of the direct sum of two one-weight cyclic codes, were recently presented in [4]. On the other hand, an explicit formula for the number of one-weight cyclic codes, when the length and dimension are given, was proved in [3]. By imposing some conditions on the finite field, we now combine both results in order to give a lower bound for the number of two-weight cyclic codes with composite parity-check polynomials. © 2008 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Vega, G. (2008). On the number of two-weight cyclic codes with composite parity-check polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5130 LNCS, pp. 144–156). https://doi.org/10.1007/978-3-540-69499-1_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
