Maximum distance separable poset codes (Q1009045)

From MaRDI portal

Revision as of 09:01, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Maximum distance separable poset codes	scientific article

Statements

scholarly article

0 references

Maximum distance separable poset codes (English)

0 references

0 references

0 references

Designs, Codes and Cryptography

0 references

publication date

31 March 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10623-008-9204-8

0 references

Classification of perfect linear codes with crown poset structure

0 references

Codes with a poset metric

0 references

Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets

0 references

The poset structures admitting the extended binary Hamming code to be a perfect code

0 references

A Classification of Posets Admitting the MacWilliams Identity

0 references

0 references

0 references

Point sets and sequences with small discrepancy

0 references

A combinatorial problem for vector spaces over finite fields

0 references

Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10623-008-9204-8

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1009045

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1009045&oldid=35101060"