Stopping Sets of Hermitian Codes

Sarah E. Anderson; Gretchen L. Matthews

doi:10.1109/TIT.2016.2592961

Back

Journal article

Peer reviewed

Stopping Sets of Hermitian Codes

Sarah E. Anderson and Gretchen L. Matthews

IEEE transactions on information theory, Vol.62(11), pp.6304-6314

11/2016

DOI: https://doi.org/10.1109/TIT.2016.2592961

Abstract

algebraic geometric code

Electronic mail

Hermitian code

Iterative decoding

Linear codes

Reed-Solomon codes

Riemann-Roch space

Sparse matrices

Stopping set

Combinatorial structures called stopping sets are useful in analyzing the performance of a linear code when coupled with an iterative decoding algorithm over an erasure channel. In this paper, we consider stopping sets of Hermitian codes.

Metrics

1 Record Views

Details

Title: Stopping Sets of Hermitian Codes
Author/Creator: Sarah E. Anderson - University of St. Thomas - Minnesota
Gretchen L. Matthews - Clemson University
Publication Details: IEEE transactions on information theory, Vol.62(11), pp.6304-6314
Publisher: IEEE
Grant note: MSP-111006 / NSA DMS-1403062 / NSF (10.13039/100000001)
Academic Unit: Mathematics
Language: English
Resource Type: Journal article
Record Identifier: 991015164207403691

Stopping Sets of Hermitian Codes

Abstract

Related links

Metrics

Details