### 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 language | English |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Publisher | IEEE |

Pages | 430 |

Number of pages | 1 |

Publication status | Published - 1997 |

Externally published | Yes |

Event | Proceedings of the 1997 IEEE International Symposium on Information Theory - Ulm, Ger Duration: Jun 29 1997 → Jul 4 1997 |

### Other

Other | Proceedings of the 1997 IEEE International Symposium on Information Theory |
---|---|

City | Ulm, Ger |

Period | 6/29/97 → 7/4/97 |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -