Least stringent sufficient condition on the optimality of suboptimally decoded codewords

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1995, Pages 470-

  Kasami, Tadao ^a   Koumoto, Takuya ^a   Takata, Toyoo ^a   Fujiwara, Toru ^a   Lin, Shu ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; BINARY SEQUENCES; BLOCK CODES; CODING ERRORS; COMPUTER SIMULATION; DECODING; ITERATIVE METHODS; PERFORMANCE; PHASE SHIFT KEYING; PROBABILITY; SPURIOUS SIGNAL NOISE;

ADDITIVE WHITE GAUSSIAN NOISE CHANNEL; BINARY LINEAR BLOCK CODES; CHASE ALGORITHM; ERROR CONTROL; REED-MULLER CODES OF LENGTH; SUBOPTIMALLY DECODED CODEWORDS; TUPLES;

INFORMATION THEORY;

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

References (6)