A tight upper bound on the BER of linear systematic block codes

Pavan Kumar Vitthaladevuni; Mohamed Slim Alouini

doi:10.1109/LCOMM.2004.827386

A tight upper bound on the BER of linear systematic block codes

Pavan Kumar Vitthaladevuni^*, Mohamed Slim Alouini

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

We present in this letter new upper bounds for linear and systematic block codes. Both perfect and quasi-perfect codes are considered. Numerical results show that our new bounds give much tighter results compared to the classical union-Chernoff bound. In addition, these bounds are more accurate than the leading term approximations especially at low signal-to-noise ratio.

Original language	English (US)
Pages (from-to)	299-301
Number of pages	3
Journal	IEEE Communications Letters
Volume	8
Issue number	5
DOIs	https://doi.org/10.1109/LCOMM.2004.827386
State	Published - May 2004
Externally published	Yes

Keywords

Block codes
Parity check matrices
Syndrome decoding
Union-chernoff bound

ASJC Scopus subject areas

Electrical and Electronic Engineering
Computer Science Applications
Modeling and Simulation

Access to Document

10.1109/LCOMM.2004.827386

Cite this

@article{eaa31f968243477da323d3a5654a21ba,

title = "A tight upper bound on the BER of linear systematic block codes",

abstract = "We present in this letter new upper bounds for linear and systematic block codes. Both perfect and quasi-perfect codes are considered. Numerical results show that our new bounds give much tighter results compared to the classical union-Chernoff bound. In addition, these bounds are more accurate than the leading term approximations especially at low signal-to-noise ratio.",

keywords = "Block codes, Parity check matrices, Syndrome decoding, Union-chernoff bound",

author = "Vitthaladevuni, {Pavan Kumar} and Alouini, {Mohamed Slim}",

year = "2004",

month = may,

doi = "10.1109/LCOMM.2004.827386",

language = "English (US)",

volume = "8",

pages = "299--301",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - A tight upper bound on the BER of linear systematic block codes

AU - Vitthaladevuni, Pavan Kumar

AU - Alouini, Mohamed Slim

PY - 2004/5

Y1 - 2004/5

N2 - We present in this letter new upper bounds for linear and systematic block codes. Both perfect and quasi-perfect codes are considered. Numerical results show that our new bounds give much tighter results compared to the classical union-Chernoff bound. In addition, these bounds are more accurate than the leading term approximations especially at low signal-to-noise ratio.

AB - We present in this letter new upper bounds for linear and systematic block codes. Both perfect and quasi-perfect codes are considered. Numerical results show that our new bounds give much tighter results compared to the classical union-Chernoff bound. In addition, these bounds are more accurate than the leading term approximations especially at low signal-to-noise ratio.

KW - Block codes

KW - Parity check matrices

KW - Syndrome decoding

KW - Union-chernoff bound

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

U2 - 10.1109/LCOMM.2004.827386

DO - 10.1109/LCOMM.2004.827386

M3 - Article

AN - SCOPUS:2942594701

SN - 1089-7798

VL - 8

SP - 299

EP - 301

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 5

ER -

A tight upper bound on the BER of linear systematic block codes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this