Maximum distance separable poset codes
type: Item
instance of: scholarly article
title: Maximum distance separable poset codes
zbMATH Open document ID: 1178.94226
author: Jong Yoon Hyun
author: Hyun Kwang Kim
published in: Designs, Codes and Cryptography
publication date: 2009-03-31T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 5536756
MaRDI profile type: Publication
full work available at URL: s10623-008-9204-8
OpenAlex ID: W2067569336
cites work: Classification of perfect linear codes with crown poset structure
cites work: Codes with a poset metric
cites work: Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
cites work: The poset structures admitting the extended binary Hamming code to be a perfect code
cites work: A Classification of Posets Admitting the MacWilliams Identity
cites work: Q4301239
cites work: Q4146667
cites work: Point sets and sequences with small discrepancy
cites work: A combinatorial problem for vector spaces over finite fields
cites work: Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
cites work: Q4344108
DOI: 10.1007/S10623-008-9204-8
description: scientific article; zbMATH DE number 5536756