NobleBlocks

Research indexJournal article

Partial permutation decoding for abelian codes

Bernal, Simón

1 Jul 2012

NobleIDark:/48914/w1/20260525/19FE2C82DOI10.1109/isit.2012.6284011

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

We show some sufficient conditions for a semisimple abelian code to be permutation decodable. We find non trivial partial PD-sets with respect to the information set introduced red by the authors in a previous paper. By using these results we present examples of permutation decodable abelian codes improving the bounds about the dimension given by S. G. S. Shiva, K. C. Fung and H. S. Y. Tan.

Discussion

Citations

Topics

More

Suggest a correction or report