Add to ORKGWe present an algorithm to obtain a lower bound on the distance of cyclic codes, improving Schaub algorithm. In particular, we can provide new better bounds for the duals of binary primitive narrow-sense BCH codes of length 255
International audienceWe consider duals of BCH codes of length p^m-1 over GF(p). A lower bound on th...
In this paper, we give a natural way of deciding whether a given cyclic code contains a word of give...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the descriptio...
We describe an algorithm that improves on the standard algorithm for computing the minimal distance ...
We describe an algorithm that improves on the standard algorithm for computing the minimal distance ...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
Abstract—A new approach to bound the minimum distance of q-ary cyclic codes is presented. The connec...
Using equivalent codes it is shown that the BCH-bound for the following narrowsense BCH-codes alread...
Abstract. We describe an algorithm that improves on the standard algorithm for computing the minimal...
Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding a...
Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bo...
International audienceWe consider duals of BCH codes of length p^m-1 over GF(p). A lower bound on th...
In this paper, we give a natural way of deciding whether a given cyclic code contains a word of give...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the descriptio...
We describe an algorithm that improves on the standard algorithm for computing the minimal distance ...
We describe an algorithm that improves on the standard algorithm for computing the minimal distance ...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
Abstract—A new approach to bound the minimum distance of q-ary cyclic codes is presented. The connec...
Using equivalent codes it is shown that the BCH-bound for the following narrowsense BCH-codes alread...
Abstract. We describe an algorithm that improves on the standard algorithm for computing the minimal...
Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding a...
Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bo...
International audienceWe consider duals of BCH codes of length p^m-1 over GF(p). A lower bound on th...
In this paper, we give a natural way of deciding whether a given cyclic code contains a word of give...
International audienceA new bound on the minimum distance of q-ary cyclic codes is proposed. It is b...