Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
From MaRDI portal
Publication:5138854
DOI10.1109/TIT.2020.2993179zbMath1453.94144OpenAlexW3021289972MaRDI QIDQ5138854
Jungyun Lee, Jong Yoon Hyun, Yoon-Jin Lee
Publication date: 4 December 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2020.2993179
Related Items
Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal gray image ⋮ Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes ⋮ Few-weight quaternary codes via simplicial complexes ⋮ New classes of binary few weight codes from trace codes over a chain ring ⋮ Several classes of linear codes with few weights over finite fields ⋮ Three new constructions of optimal linear codes with few weights ⋮ Octanary linear codes using simplicial complexes ⋮ 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
