Bounds on Single-Exclusion Numbers and Stopping Redundancy of MDS Codes

Bounds on Single-Exclusion Numbers and Stopping Redundancy of MDS Codes

New bounds on single-exclusion numbers are obtained via probabilistic arguments, recurrent relations, as well as explicit constructions. The new bounds are used to better understand the stopping redundancy of MDS codes. In particular, it is shown that for any fixed k, the stopping redundancy of a li...

Full description

Saved in:
Bibliographic Details
Published in:2007 IEEE International Symposium on Information Theory pp. 2941 - 2945
Main Authors: Junsheng Han, Siegel, P.H., Roth, R.M.
Format: Conference Proceeding
Language:English
Published: IEEE 01-06-2007
Subjects:
Computer science
Iterative decoding
Linear code
Maximum likelihood decoding
Parity check codes
Upper bound
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:New bounds on single-exclusion numbers are obtained via probabilistic arguments, recurrent relations, as well as explicit constructions. The new bounds are used to better understand the stopping redundancy of MDS codes. In particular, it is shown that for any fixed k, the stopping redundancy of a linear [n, k] MDS code is between 1/k+1( k n ) and (1 + o(1))1/k ( k n ).
ISBN:9781424413973
1424413974
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2007.4557665