Optimal Few-Weight Codes From Simplicial Complexes
From MaRDI portal
Publication:5123953
DOI10.1109/TIT.2019.2946840zbMath1448.94279arXiv1910.04334OpenAlexW2980061979MaRDI QIDQ5123953
Qin Yue, Xiaomeng Zhu, Yansheng Wu
Publication date: 29 September 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.04334
Related Items (11)
Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal gray image ⋮ Two classes of optimal \(p\)-ary few-weight codes from down-sets ⋮ Few-weight quaternary codes via simplicial complexes ⋮ New classes of binary few weight codes from trace codes over a chain ring ⋮ Two classes of few-Lee weight \(\mathbb{Z}_2 [u\)-linear codes using simplicial complexes and minimal codes via Gray map] ⋮ A unified construction of optimal and distance optimal two or three-weight codes ⋮ Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\) ⋮ Two classes of optimal few-weight codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\) ⋮ Optimal minimal linear codes from posets ⋮ A family of linear codes from constant dimension subspace codes ⋮ Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u\)-additive codes from down-sets]
This page was built for publication: Optimal Few-Weight Codes From Simplicial Complexes
