DocumentCode :
2032240
Title :
Bounds on Single-Exclusion Numbers and Stopping Redundancy of MDS Codes
Author :
Junsheng Han ; Siegel, P.H. ; Roth, R.M.
Author_Institution :
Univ. of California, La Jolla, CA
fYear :
2007
fDate :
24-29 June 2007
Firstpage :
2941
Lastpage :
2945
Abstract :
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).
Keywords :
linear codes; number theory; probability; redundancy; set theory; explicit construction; linear MDS code stopping redundancy; maximum distance separable code; probabilistic argument; recurrent relation; set theory; single-exclusion number; Computer science; Iterative decoding; Linear code; Maximum likelihood decoding; Parity check codes; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location :
Nice
Print_ISBN :
978-1-4244-1397-3
Type :
conf
DOI :
10.1109/ISIT.2007.4557665
Filename :
4557665
Link To Document :
بازگشت