MacWilliams type identities for linear codes on certain pomsets: chain, direct and ordinal sum of pomsets (Q2297736)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7170111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MacWilliams type identities for linear codes on certain pomsets: chain, direct and ordinal sum of pomsets |
scientific article; zbMATH DE number 7170111 |
Statements
MacWilliams type identities for linear codes on certain pomsets: chain, direct and ordinal sum of pomsets (English)
0 references
20 February 2020
0 references
A partially ordered \(m\)-set is known as a pomset. A pomset gives rise to a weight enumerator with respect to that order. In general, MacWilliams relations relate the weight enumerator of a linear code with the weight enumerator of its orthogonal. These relations are vital to the use of any weight enumerator. The authors give MacWilliams type relations for certain pomsets for codes over \(Z_m\).
0 references
hierarchical pomset
0 references
Lee code
0 references
MacWilliams identity
0 references
pomset code
0 references
poset code
0 references
weight enumerator
0 references
0 references
0 references
0.89786744
0 references
0.8888898
0 references
0.88816607
0 references
0.88450813
0 references
0.88292336
0 references
0.87521154
0 references
