Efficient encoding and minimum distance bounds of Reed-Solomon-type array codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 282-

  Mittelholzer, Thomas ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARRAY CODES;

ARRAYS; ENCODING (SYMBOLS); MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

CODES (SYMBOLS);

EID: 0036351583     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. Array codes as low-density parity-check codes