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.
A new bound for cyclic codes beating the roos bound
Piva, Matteo;Sala, Massimiliano
2013-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
