Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes

DOI10.1109/TIT.2022.3167662zbMath1505.94091arXiv2106.10782OpenAlexW3202561437MaRDI QIDQ5096975

Hao Chen

Publication date: 19 August 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

Reed-Muller codescoordinate-ordering-free upper boundsinsdel distances of linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

This page was built for publication: Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes