Maximum likelihood soft decoding of binary codes by projecting on abelian group codes

Moshe Ran; Jakov Snyders

Maximum likelihood soft decoding of binary codes by projecting on abelian group codes

Moshe Ran^*, Jakov Snyders

^*Corresponding author for this work

Department of Electrical Engineering - Systems

Research output: Contribution to conference › Paper › peer-review

Abstract

An approach to fast maximum likelihood decoding of some binary codes is presented. The binary codewords are regarded as images of some C_g group code, called the projected code, defined over an Abelian group A. The neighbourhood of z, z qq A^N, the vector of symbol-by-symbol soft decoding, is examined to identify the most likely codeword of C_g. A small list of candidate codewords is prepared by employing certain elimination rules. A substantial reduction of computational complexity is achieved by this method.

Original language	English
Pages	5.1.3/1-5
State	Published - 1995
Event	Proceedings of the 18th Convention of Electrical and Electronics Engineers in Israel - Tel Aviv, Isr Duration: 7 Mar 1995 → 8 Mar 1995

Conference

Conference	Proceedings of the 18th Convention of Electrical and Electronics Engineers in Israel
City	Tel Aviv, Isr
Period	7/03/95 → 8/03/95

Cite this

@conference{1df6557b53074cc18fc203f04fb89ca0,

title = "Maximum likelihood soft decoding of binary codes by projecting on abelian group codes",

abstract = "An approach to fast maximum likelihood decoding of some binary codes is presented. The binary codewords are regarded as images of some Cg group code, called the projected code, defined over an Abelian group A. The neighbourhood of z, z qq AN, the vector of symbol-by-symbol soft decoding, is examined to identify the most likely codeword of Cg. A small list of candidate codewords is prepared by employing certain elimination rules. A substantial reduction of computational complexity is achieved by this method.",

author = "Moshe Ran and Jakov Snyders",

year = "1995",

language = "אנגלית",

pages = "5.1.3/1--5",

note = "null ; Conference date: 07-03-1995 Through 08-03-1995",

}

TY - CONF

T1 - Maximum likelihood soft decoding of binary codes by projecting on abelian group codes

AU - Ran, Moshe

AU - Snyders, Jakov

PY - 1995

Y1 - 1995

N2 - An approach to fast maximum likelihood decoding of some binary codes is presented. The binary codewords are regarded as images of some Cg group code, called the projected code, defined over an Abelian group A. The neighbourhood of z, z qq AN, the vector of symbol-by-symbol soft decoding, is examined to identify the most likely codeword of Cg. A small list of candidate codewords is prepared by employing certain elimination rules. A substantial reduction of computational complexity is achieved by this method.

AB - An approach to fast maximum likelihood decoding of some binary codes is presented. The binary codewords are regarded as images of some Cg group code, called the projected code, defined over an Abelian group A. The neighbourhood of z, z qq AN, the vector of symbol-by-symbol soft decoding, is examined to identify the most likely codeword of Cg. A small list of candidate codewords is prepared by employing certain elimination rules. A substantial reduction of computational complexity is achieved by this method.

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

M3 - הרצאה

AN - SCOPUS:0029229111

SP - 5.1.3/1-5

Y2 - 7 March 1995 through 8 March 1995

ER -

Maximum likelihood soft decoding of binary codes by projecting on abelian group codes

Abstract

Conference

Other files and links

Fingerprint

Cite this