Block codes in pomset metric over Z_m
From MaRDI portal
Publication:6074025
Abstract: In this paper, we introduce codes equipped with pomset block metric. A Singleton type bound for pomset block codes is obtained. Code achieving the Singleton bound, called a maximum distance separable code (for short, MDS ()-code) is also investigated. We extend the concept of -perfect codes and -perfect codes to pomset block metric. The relation between -perfect codes and MDS -codes is also considered. When all blocks have the same dimension, we prove the duality theorem for codes and study the weight distribution of MDS pomset block codes when the pomset is a chain.
Recommendations
- Codes with a pomset metric and constructions
- Error-block codes and poset metrics
- Perfect codes in poset spaces and poset block spaces
- Perfect codes in poset block spaces
- Constructing blocks codes over \(GF(p)\) from block codes over \(GF(p^m)\)
- MDS and I-Perfect Codes in Pomset Metric
- scientific article; zbMATH DE number 7180114
- scientific article; zbMATH DE number 1230488
- MDS and \(I\)-perfect poset block codes
- A class of constacyclic codes over \(\mathbb Z_{p^m}\)
Cites work
- A combinatorial problem for vector spaces over finite fields
- Classification of Niederreiter–Rosenbloom–Tsfasman Block Codes
- Codes with a pomset metric and constructions
- Codes with a poset metric
- Error-block codes and poset metrics
- General relations between partially ordered multisets and their chains and antichains
- Linear error-block codes
- MDS and I-Perfect Codes in Pomset Metric
- MDS and \(I\)-perfect poset block codes
- Maximum distance separable poset codes
- Multiset topologies induced by multiset relations
- Point sets and sequences with small discrepancy
Cited in
(4)
This page was built for publication: Block codes in pomset metric over \(\mathbb{Z}_m\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074025)