Add to ORKGWe give a generalization of the shift bound on the minimum distance for cyclic codes which applies to Reed-Muller and algebraic-geometric codes. The number of errors one can correct by majority coset decoding is up to half the shift bound
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...
It is shown how decoding beyond the designed distance can be accomplished for a certain decoding alg...
We give a generalization of the shift bound on the minimum distance for cyclic codes which applies t...
We give a generalization of the shift bound on the minimum distance for cyclic codes which applies t...
We give a generalization of the shift bound on the minimum distance for cyclic codes which applies t...
Abstract: We prove that if there are consecutive gaps at a rational point on a smooth curve defined ...
AbstractWe prove a new bound for the minimum distance of geometric Goppa codes that generalizes two ...
Abstract—A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite ...
5 pages, no figure, accpted for ISIT2013International audienceTwo generalizations of the Hartmann--T...
We generalize results of Homma and Kim [2001, J. Pure Appl. Algebra 162, 273–290] concerning an impr...
5 pages, no figure, accpted for ISIT2013International audienceTwo generalizations of the Hartmann--T...
We generalize results of Homma and Kim [J. Pure Appl. Algebra Vol. 162, (2001), pp. 273-290] concern...
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...
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...
It is shown how decoding beyond the designed distance can be accomplished for a certain decoding alg...
We give a generalization of the shift bound on the minimum distance for cyclic codes which applies t...
We give a generalization of the shift bound on the minimum distance for cyclic codes which applies t...
We give a generalization of the shift bound on the minimum distance for cyclic codes which applies t...
Abstract: We prove that if there are consecutive gaps at a rational point on a smooth curve defined ...
AbstractWe prove a new bound for the minimum distance of geometric Goppa codes that generalizes two ...
Abstract—A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite ...
5 pages, no figure, accpted for ISIT2013International audienceTwo generalizations of the Hartmann--T...
We generalize results of Homma and Kim [2001, J. Pure Appl. Algebra 162, 273–290] concerning an impr...
5 pages, no figure, accpted for ISIT2013International audienceTwo generalizations of the Hartmann--T...
We generalize results of Homma and Kim [J. Pure Appl. Algebra Vol. 162, (2001), pp. 273-290] concern...
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...
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...
It is shown how decoding beyond the designed distance can be accomplished for a certain decoding alg...