Least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis

Marc P C Fossorier, Takuya Kusaka, Toyoo Takata, Tadao Kasami, Shu Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

Given a binary linear block code with weight profile, a codeword is mapped into the binary phase shift keying sequence x. The maximum likelihood decoding (MLD) solution is the codeword which minimize the correlation discrepancy. Any lower bound will provide a sufficient condition on the optimality of a candidate codeword.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE
Pages430
Number of pages1
Publication statusPublished - 1997
Externally publishedYes
EventProceedings of the 1997 IEEE International Symposium on Information Theory - Ulm, Ger
Duration: Jun 29 1997Jul 4 1997

Other

OtherProceedings of the 1997 IEEE International Symposium on Information Theory
CityUlm, Ger
Period6/29/977/4/97

    Fingerprint

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Applied Mathematics
  • Modelling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Fossorier, M. P. C., Kusaka, T., Takata, T., Kasami, T., & Lin, S. (1997). Least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis. In IEEE International Symposium on Information Theory - Proceedings (pp. 430). IEEE.