Реферат: In this paper, we study the minimum distances of binary linear codes with parity check matrices formed from subset inclusion matrices Wt,n,k, representing t-element subsets versus k-element subsets of an n-element set. We provide both lower and upper bounds on the minimum distances of these codes and determine the exact values for any t ≤ 3 and sufficiently large n. Our study combines design and integer linear programming techniques. The codes we consider are connected to locally recoverable codes, LDPC codes and combinatorial designs. Furthermore, we construct quasi-cyclic LDPC codes from inclusion matrices that exhibit performance comparable to or slightly better than MacKay-type codes when evaluated using bit flipping and min-sum algorithms.

Библиографическая ссылка: Marin A.D. , Mogilnykh I.Y.
Binary Codes From Subset Inclusion Matrices
Journal of Combinatorial Designs. 2025. DOI: 10.1002/jcd.22012 WOS Scopus OpenAlex

Даты:

Опубликована online:

12 окт. 2025 г.

Идентификаторы БД:

Web of science:	WOS:001590939400001
Scopus:	2-s2.0-105018685141
OpenAlex:	W4415093860

Цитирование в БД: Пока нет цитирований

Альметрики: