2000 character limit reached
Perfect Codes for Uniform Chains Poset Metrics
Published 28 Jul 2011 in cs.IT, math.CO, and math.IT | (1107.5708v2)
Abstract: The class of poset metrics is very large and contains some interesting families of metrics. A family of metrics, based on posets which are formed from disjoint chains which have the same size, is examined. A necessary and sufficient condition, for the existence of perfect single-error-correcting codes for such poset metrics, is proved.
Paper Prompts
Sign up for free to create and run prompts on this paper.