MacWilliams type identities for linear codes on certain pomsets: chain, direct and ordinal sum of pomsets

DOI10.1016/J.DISC.2019.111782zbMath1442.94056OpenAlexW2999289110WikidataQ126396383 ScholiaQ126396383MaRDI QIDQ2297736

Gnana Sudha Irrinki, Selvaraj R. S.

Publication date: 20 February 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.111782

zbMATH Keywords

MacWilliams identityweight enumeratorLee codeposet codehierarchical pomsetpomset code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

Codes with respect to weighted poset block metric

Cites Work

• Unnamed Item
• Unnamed Item
• MacWilliams type identities on the Lee and Euclidean weights for linear codes over \(\mathbb{Z}_\ell\)
• MacWilliams-type identities for fragment and sphere enumerators
• Codes with a pomset metric and constructions
• 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.
• Codes with a poset metric
• POSET METRICS ADMITTING ASSOCIATION SCHEMES AND A NEW PROOF OF MACWILLIAMS IDENTITY
• Classification of Poset-Block Spaces Admitting MacWilliams-Type Identity
• A Classification of Posets Admitting the MacWilliams Identity
• Duality for modules over finite rings and applications to coding theory

This page was built for publication: MacWilliams type identities for linear codes on certain pomsets: chain, direct and ordinal sum of pomsets