Poset codes: partial orders, metrics and coding theory
DOI10.1007/978-3-319-93821-9zbMATH Open1480.94001OpenAlexW2899114616MaRDI QIDQ3176293FDOQ3176293
Marcelo M. S. Alves, Marcelo Firer, Jerry Anderson Pinheiro, Luciano Panek
Publication date: 19 July 2018
Published in: SpringerBriefs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-93821-9
Recommendations
boundsdualityposet metricspartially ordered multisetshierarchical posetscombinatorial metricsmetrics defined by directed graphmulti-chain posetspacking radius of a codeposet-block metrics
Combinatorics of partially ordered sets (06A07) Linear codes (general theory) (94B05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Cited In (8)
- The Poset Metrics That Allow Binary Codes of Codimension $m$ to be $m$-, $(m-1)$-, or $(m-2)$-Perfect
- On covering problems in hierarchical poset spaces
- Profinite Cappitt groups
- Title not available (Why is that?)
- On perfect poset codes
- Ordered covering arrays and upper bounds on covering codes
- Fractional decoding and the Rosenbloom-Tsfasman metric
- Title not available (Why is that?)
This page was built for publication: Poset codes: partial orders, metrics and coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176293)