Finding distance profiles of unequal error protection block codes

Martin Bossert; Vladimir Sidorenko; Victor Zyablov

doi:10.1002/ett.1190

Finding distance profiles of unequal error protection block codes

Martin Bossert, Vladimir Sidorenko, Victor Zyablov

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

1 Scopus citations

Abstract

We consider distance profiles of arbitrary block codes (over arbitrary alphabets) with unequal error correcting capabilities. We show that for group codes (and hence for codes linear over fields) these distance profiles can be obtained using the well known MaxLog a posteriori probability decoding algorithm.

Original language	English
Pages (from-to)	541-546
Number of pages	6
Journal	European Transactions on Telecommunications
Volume	18
Issue number	5
DOIs	https://doi.org/10.1002/ett.1190
State	Published - Aug 2007
Externally published	Yes

Access to Document

10.1002/ett.1190

Cite this

@article{6b966f1e073e47ffa7b9b4f95030e2fa,

title = "Finding distance profiles of unequal error protection block codes",

abstract = "We consider distance profiles of arbitrary block codes (over arbitrary alphabets) with unequal error correcting capabilities. We show that for group codes (and hence for codes linear over fields) these distance profiles can be obtained using the well known MaxLog a posteriori probability decoding algorithm.",

author = "Martin Bossert and Vladimir Sidorenko and Victor Zyablov",

year = "2007",

month = aug,

doi = "10.1002/ett.1190",

language = "English",

volume = "18",

pages = "541--546",

journal = "European Transactions on Telecommunications",

issn = "1124-318X",

publisher = "Wiley-Blackwell",

number = "5",

}

TY - JOUR

T1 - Finding distance profiles of unequal error protection block codes

AU - Bossert, Martin

AU - Sidorenko, Vladimir

AU - Zyablov, Victor

PY - 2007/8

Y1 - 2007/8

N2 - We consider distance profiles of arbitrary block codes (over arbitrary alphabets) with unequal error correcting capabilities. We show that for group codes (and hence for codes linear over fields) these distance profiles can be obtained using the well known MaxLog a posteriori probability decoding algorithm.

AB - We consider distance profiles of arbitrary block codes (over arbitrary alphabets) with unequal error correcting capabilities. We show that for group codes (and hence for codes linear over fields) these distance profiles can be obtained using the well known MaxLog a posteriori probability decoding algorithm.

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

U2 - 10.1002/ett.1190

DO - 10.1002/ett.1190

M3 - Article

AN - SCOPUS:34547692697

SN - 1124-318X

VL - 18

SP - 541

EP - 546

JO - European Transactions on Telecommunications

JF - European Transactions on Telecommunications

IS - 5

ER -

Finding distance profiles of unequal error protection block codes

Abstract

Access to Document

Other files and links

Fingerprint

Cite this