MacWilliams-type identities for fragment and sphere enumerators
From MaRDI portal
Publication:854830
DOI10.1016/j.ejc.2005.07.018zbMath1105.94028OpenAlexW2021664529MaRDI QIDQ854830
Publication date: 7 December 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.07.018
Combinatorics on words (68R15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65)
Related Items (3)
Linear codes on posets with extension property ⋮ MacWilliams type identities for linear codes on certain pomsets: chain, direct and ordinal sum of pomsets ⋮ Symmetry groups of Rosenbloom-Tsfasman spaces
Cites Work
- Point sets and sequences with small discrepancy
- Codes for the \(m\)-metric
- The automorphism group of a linear space with the Rosenbloom-Tsfasman metric
- A MacWilliams-type identity for linear codes on weak order
- On a MacWilliams type identity and a perfectness for a binary linear (\(n,n-1,j\))-poset code.
- Character sums and MacWilliams identities
- Codes with a poset metric
- A Classification of Posets Admitting the MacWilliams Identity
- Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: MacWilliams-type identities for fragment and sphere enumerators