Pages that link to "Item:Q1874356"
From MaRDI portal
The following pages link to On a MacWilliams type identity and a perfectness for a binary linear (\(n,n-1,j\))-poset code. (Q1874356):
Displaying 12 items.
- MacWilliams-type identities for fragment and sphere enumerators (Q854830) (← links)
- Even poset and a parity result for binary linear code (Q855546) (← links)
- Groups of linear isometries on poset structures (Q941337) (← links)
- A MacWilliams-type identity for linear codes on weak order (Q1868847) (← links)
- Character sums and MacWilliams identities (Q1886359) (← links)
- On perfect poset codes (Q2194510) (← links)
- MacWilliams type identities for linear codes on certain pomsets: chain, direct and ordinal sum of pomsets (Q2297736) (← links)
- On \(P\)-weight and \(P\)-distance inequalities (Q2488934) (← links)
- On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure (Q2566155) (← links)
- Poset metrics admitting association schemes and a new proof of MacWilliams identity (Q2861446) (← links)
- Association schemes and MacWilliams dualities for generalized Niederreiter–Rosenbloom–Tsfasman posets (Q3144098) (← links)
- MacWilliams identities over some special posets (Q3451837) (← links)
