Duality of codes supported on regular lattices, with an application to enumerative combinatorics
DOI10.1007/s10623-017-0436-3zbMath1411.94101arXiv1510.02383OpenAlexW2962880178MaRDI QIDQ1650813
Publication date: 13 July 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.02383
weight functionMacWilliams identityweight distributionextremal codeenumerative combinatoricsdistance distributionadditive code (finite abelian group)poset latticesupport map
Exact enumeration problems, generating functions (05A15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Finite abelian groups (20K01) Combinatorial codes (94B25)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rank-metric codes and their duality theory
- Matrices with restricted entries and \(q\)-analogues of permutations
- Partitions of Frobenius rings induced by the homogeneous weight
- Weight distribution of translates of MDS codes
- Fourier-invariant pairs of partitions of finite Abelian groups and association schemes
- Association schemes and t-designs in regular semilattices
- Bilinear forms over a finite field, with applications to coding theory
- A metric for codes over residue class rings
- \(q\)-rook polynomials and matrices over finite fields
- Counting points on varieties over finite fields related to a conjecture of Kontsevich
- On Fourier-invariant partitions of finite Abelian groups and the MacWilliams identity for group codes
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
- On the weight distribution of codes over finite rings
- Fourier-reflexive partitions and MacWilliams identities for additive codes
- The linear programming bound for codes over finite Frobenius rings
- Representation by quadratic forms in a finite field
- Representations by skew forms in a finite field
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Fundamentals of Error-Correcting Codes
- On Metrics for Error Correction in Network Coding
- Orthogonal Matrices Over Finite Fields
This page was built for publication: Duality of codes supported on regular lattices, with an application to enumerative combinatorics