CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Voronoi regions for binary linear block codes

Erik Agrell (Institutionen för informationsteori, Informationsteori)
IEEE Transactions on Information Theory (0018-9448 ). Vol. 42 (1996), 1, p. 310-316.
[Artikel, refereegranskad vetenskaplig]

The Voronoi regions of a block code govern many aspects of the code's performance on a Gaussian channel, and they are fundamental instruments in, for example, error probability analysis and soft-decision decoding. The article presents an efficient method for finding the boundaries of the Voronoi regions for an arbitrary binary linear block code. Two theoretical results together lead to the Voronoi regions. First, it is shown that the question of the Voronoi neighborship can be reduced into testing a simpler relation, called the Gabriel neighborship. Second, a fast method of recognising Gabriel neighbors is proposed. These results are finally employed to describe the Voronoi regions for the Golay codes and several BCH codes, including Hamming codes.

Nyckelord: error-control

Denna post skapades 2006-09-12. Senast ändrad 2016-04-28.
CPL Pubid: 16140


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för informationsteori, Informationsteori (1980-1997)


Information Technology

Chalmers infrastruktur