Block codes in pomset metric over Z_m

From MaRDI portal
Publication:6074025

DOI10.1007/S10623-023-01249-XzbMATH Open1522.94133arXiv2303.01721MaRDI QIDQ6074025FDOQ6074025


Authors: Wen Ma, Jinquan Luo Edit this on Wikidata


Publication date: 12 October 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: In this paper, we introduce codes equipped with pomset block metric. A Singleton type bound for pomset block codes is obtained. Code achieving the Singleton bound, called a maximum distance separable code (for short, MDS (mathbbP,pi)-code) is also investigated. We extend the concept of I-perfect codes and r-perfect codes to pomset block metric. The relation between I-perfect codes and MDS (mathbbP,pi)-codes is also considered. When all blocks have the same dimension, we prove the duality theorem for codes and study the weight distribution of MDS pomset block codes when the pomset is a chain.


Full work available at URL: https://arxiv.org/abs/2303.01721




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Block codes in pomset metric over \(\mathbb{Z}_m\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074025)