Generalized MacWilliams identities and their applications to perfect binary codes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 617939
- On the MacWilliams identities for linear codes
- A MacWilliams Identity for Convolutional Codes: The General Case
- On the MacWilliams Identity for Convolutional Codes
- Publication:4945073
- scientific article; zbMATH DE number 2154147
- Dual convolutional codes and the MacWilliams identities
- Generalized MacWilliams Identities for<tex>$BBZ _4$</tex>-Linear Codes
- A new MacWilliams type identity for linear codes
- scientific article; zbMATH DE number 1778176
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 2077652 (Why is no real title available?)
- MacWilliams identities and matroid polynomials
- On the reconstruction of perfect codes
- Overlap and Covering Polynomials with Applications to Designs and Self-Dual Codes
- Perfect binary codes: constructions, properties, and enumeration
Cited in
(8)- A MACWILLIAMS FORMULA FOR CONVOLUTIONAL CODES
- On a MacWilliams type identity and a perfectness for a binary linear (\(n,n-1,j\))-poset code.
- Weighted Hamming metric structures
- Algorithms and codes for the Macdonald function: Recent progress and comparisons.
- Local duality theorem for \(q\)-ary 1-perfect codes
- Local duality for equitable partitions of a Hamming space
- MacWilliams duality and a Gleason-type theorem on self-dual bent functions
- MacWilliams-type identities on vectorial Boolean functions with bent components and applications
This page was built for publication: Generalized MacWilliams identities and their applications to perfect binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009104)
