A distance between channels: the average error of mismatched channels

Two channels are equivalent if their maximum likelihood (ML) decoders coincide for every code. We show that this equivalence relation partitions the space of channels into a generalized hyperplane arrangement. With this, we define a coding distance between channels in terms of their ML-decoders whic...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Designs, codes, and cryptography Ročník 87; číslo 2-3; s. 481 - 493
Hlavní autoři:	D’Oliveira, Rafael G. L., Firer, Marcelo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 15.03.2019 Springer Nature B.V
Témata:	Channels Circuits Coding and Information Theory Computer Science Cryptology Data Structures and Information Theory Decoders Decoding Discrete Mathematics in Computer Science Equivalence Hyperplanes Information and Communication Maximum likelihood decoding Special Issue: Coding and Cryptography 68P30 52C35 51E22 Mismatched channels Space of channels Maximum likelihood decoding
ISSN:	0925-1022, 1573-7586
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Two channels are equivalent if their maximum likelihood (ML) decoders coincide for every code. We show that this equivalence relation partitions the space of channels into a generalized hyperplane arrangement. With this, we define a coding distance between channels in terms of their ML-decoders which is meaningful from the decoding point of view, in the sense that the closer two channels are, the larger is the probability of them sharing the same ML-decoder. We give explicit formulas for these probabilities.
Bibliografie:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	0925-1022 1573-7586
DOI:	10.1007/s10623-018-0557-3