Add to ORKGAbstract. We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Mathematical subject classification: 94B15. Key words: Cyclic codes, minimal distance, algorithm
This thesis started when we decided to take a look into the theory concerning upper bounds for the m...
5 pages, no figure, accpted for ISIT2013International audienceTwo generalizations of the Hartmann--T...
5 pages, no figure, accpted for ISIT2013International audienceTwo generalizations of the Hartmann--T...
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 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...
The computation of the minimum distance for q-nary cyclic AN-codes is treated in a systematic manner...
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the descriptio...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
We present an algorithm to obtain a lower bound on the distance of cyclic codes, improving Schaub a...
In this paper, we give a natural way of deciding whether a given cyclic code contains a word of give...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bo...
AbstractA method of investigating the minimum distance of binary cyclic codes of composite blockleng...
This thesis started when we decided to take a look into the theory concerning upper bounds for the m...
5 pages, no figure, accpted for ISIT2013International audienceTwo generalizations of the Hartmann--T...
5 pages, no figure, accpted for ISIT2013International audienceTwo generalizations of the Hartmann--T...
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 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...
The computation of the minimum distance for q-nary cyclic AN-codes is treated in a systematic manner...
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the descriptio...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
We present an algorithm to obtain a lower bound on the distance of cyclic codes, improving Schaub a...
In this paper, we give a natural way of deciding whether a given cyclic code contains a word of give...
International audienceA new approach to bound the minimum distance of $q$-ary cyclic codes is presen...
Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bo...
AbstractA method of investigating the minimum distance of binary cyclic codes of composite blockleng...
This thesis started when we decided to take a look into the theory concerning upper bounds for the m...
5 pages, no figure, accpted for ISIT2013International audienceTwo generalizations of the Hartmann--T...
5 pages, no figure, accpted for ISIT2013International audienceTwo generalizations of the Hartmann--T...