Codes with respect to weighted poset block metric
From MaRDI portal
Publication:6123053
DOI10.1007/s10623-023-01311-8arXiv2303.01719OpenAlexW4388221984MaRDI QIDQ6123053
Publication date: 4 March 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.01719
Cites Work
- Error-block codes and poset metrics
- Groups of linear isometries on poset structures
- Linear error-block codes
- Maximum distance separable poset codes
- A combinatorial problem for vector spaces over finite fields
- Codes for the \(m\)-metric
- The automorphism group of a linear space with the Rosenbloom-Tsfasman metric
- Codes with a pomset metric and constructions
- Codes with a poset metric
- MacWilliams type identities for linear codes on certain pomsets: chain, direct and ordinal sum of pomsets
- MDS and \(I\)-perfect poset block codes
- Automorphism group of the crown-weight space
- Association schemes and MacWilliams dualities for generalized Niederreiter–Rosenbloom–Tsfasman posets
- Optimal Anticodes, Diameter Perfect Codes, Chains and Weights
- MDS and I-Perfect Codes in Pomset Metric
- Weights Which Respect Support and NN-Decoding
- General Approach to Poset and Additive Metrics
- Weighted Posets and Digraphs Admitting the Extended Hamming Code to be a Perfect Code
- Classification of Niederreiter–Rosenbloom–Tsfasman Block Codes
- Encyclopedia of Distances
This page was built for publication: Codes with respect to weighted poset block metric