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

Moshe Ran*, Jakov Snyders

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

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.

Original languageEnglish
Pages5.1.3/1-5
StatePublished - 1995
EventProceedings of the 18th Convention of Electrical and Electronics Engineers in Israel - Tel Aviv, Isr
Duration: 7 Mar 19958 Mar 1995

Conference

ConferenceProceedings of the 18th Convention of Electrical and Electronics Engineers in Israel
CityTel Aviv, Isr
Period7/03/958/03/95

Fingerprint

Dive into the research topics of 'Maximum likelihood soft decoding of binary codes by projecting on abelian group codes'. Together they form a unique fingerprint.

Cite this