A new MacWilliams type identity for linear codes
From MaRDI portal
Publication:1355165
DOI10.14492/HOKMJ/1351516754zbMATH Open0868.05006OpenAlexW2082314545MaRDI QIDQ1355165FDOQ1355165
Authors: Keisuke Shiromoto 
Publication date: 18 August 1997
Published in: Hokkaido Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.14492/hokmj/1351516754
Cited In (13)
- Singleton bounds for codes over finite rings
- On the MacWilliams identities for linear codes
- Demi-matroids from codes over finite Frobenius rings
- Generalized MacWilliams identities and their applications to perfect binary codes
- MacWilliams type identities for linear codes on certain pomsets: chain, direct and ordinal sum of pomsets
- Title not available (Why is that?)
- Counting plane cubic curves over finite fields with a prescribed number of rational intersection points
- A MACWILLIAMS FORMULA FOR CONVOLUTIONAL CODES
- A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays
- On a MacWilliams type identity and a perfectness for a binary linear (\(n,n-1,j\))-poset code.
- A MacWilliams type identity on Lee weight for linear codes over \(\mathbb F_2 + u\mathbb F_2^\ast\)
- A MacWilliams type identity for matroids
- Designs from subcode supports of linear codes
This page was built for publication: A new MacWilliams type identity for linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355165)
