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

Binary phase shift keying
Block codes
Maximum likelihood
Decoding
Optimality
Binary
Block Codes
Sufficient Conditions
Linear Codes
Phase Shift
Discrepancy
Maximum Likelihood
Lower bound
Minimise
Profile

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.

Least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis. / Fossorier, Marc P C; Kusaka, Takuya; Takata, Toyoo; Kasami, Tadao; Lin, Shu.

IEEE International Symposium on Information Theory - Proceedings. IEEE, 1997. p. 430.

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

Fossorier, MPC, 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. IEEE, pp. 430, Proceedings of the 1997 IEEE International Symposium on Information Theory, Ulm, Ger, 6/29/97.
Fossorier MPC, Kusaka T, Takata T, Kasami T, Lin S. 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. IEEE. 1997. p. 430
Fossorier, Marc P C ; Kusaka, Takuya ; Takata, Toyoo ; Kasami, Tadao ; Lin, Shu. / Least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis. IEEE International Symposium on Information Theory - Proceedings. IEEE, 1997. pp. 430
@inproceedings{e76c3dd030814f9ea7bf81e8961c0cd8,
title = "Least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis",
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.",
author = "Fossorier, {Marc P C} and Takuya Kusaka and Toyoo Takata and Tadao Kasami and Shu Lin",
year = "1997",
language = "English",
pages = "430",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "IEEE",

}

TY - GEN

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

AU - Fossorier, Marc P C

AU - Kusaka, Takuya

AU - Takata, Toyoo

AU - Kasami, Tadao

AU - Lin, Shu

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030720705&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030720705&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030720705

SP - 430

BT - IEEE International Symposium on Information Theory - Proceedings

PB - IEEE

ER -