Parameters of Codes for the Binary Asymmetric Channel
From MaRDI portal
Abstract: We introduce two notions of discrepancy between binary vectors, which are not metric functions in general but nonetheless capture the mathematical structure of the binary asymmetric channel. In turn, these lead to two new fundamental parameters of binary error-correcting codes, both of which measure the probability that the maximum likelihood decoder fails. We then derive various bounds for the cardinality and weight distribution of a binary code in terms of these new parameters, giving examples of codes meeting the bounds with equality.
Recommendations
- scientific article; zbMATH DE number 3301962
- On optimal codes for binary asymmetric channels (Corresp.)
- Gallager error-correcting codes for binary asymmetric channels
- Optimal error detection codes for completely asymmetric binary channels
- Error Control Codes for Parallel Asymmetric Channels
- Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)
- Codes for the asymmetric broadcast channel, generated by permutations (Corresp.)
- On Equivalence of Binary Asymmetric Channels Regarding the Maximum Likelihood Decoding
- scientific article; zbMATH DE number 2091981
Cited in
(5)
This page was built for publication: Parameters of Codes for the Binary Asymmetric Channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088432)