Abstract
We present a lower bound for the distance of a cyclic code, which is computed in polynomial time from the defining set of the code. Our bound beats other similar bounds, including the Roos bound, in the majority of computed cases. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
APA
Piva, M., & Sala, M. (2013). A new bound for cyclic codes beating the Roos bound. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8080 LNCS, pp. 101–112). https://doi.org/10.1007/978-3-642-40663-8_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free