On a MacWilliams type identity and a perfectness for a binary linear (\(n,n-1,j\))-poset code.

DOI10.1016/S0012-365X(02)00624-6zbMath1071.94023MaRDI QIDQ1874356

Youngho Jang, Jeanam Park

Publication date: 25 May 2003

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

zbMATH Keywords

MacWilliams identitydual codeextended binary Hamming codebinary linear perfect poset codeenumerator polynomial

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (7)

Character sums and MacWilliams identities ⋮ MacWilliams-type identities for fragment and sphere enumerators ⋮ On perfect poset codes ⋮ Groups of linear isometries on poset structures ⋮ On \(P\)-weight and \(P\)-distance inequalities ⋮ MacWilliams type identities for linear codes on certain pomsets: chain, direct and ordinal sum of pomsets ⋮ On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure

This page was built for publication: On a MacWilliams type identity and a perfectness for a binary linear (\(n,n-1,j\))-poset code.