Abstract: In this work, the minimum distance problem for the LDPC codes in 5G standard is considered. Our approach relies on two proposed ideas: upper bound by extension of Vontobel - Smarandache Lemma and lower bound based on modular version of Brouwer-Zimmermann algorithm. The preliminary results for codes from base graph 1, without standard left-hand puncturing and without CRC are provided. We demonstrate how the proposed methods can be valuable in designing early termination strategies for 5G LDPC codes.

Cite: Mogilnykh I.
Minimum distances of LDPC codes in 5G standard
International Conference and PhD-Master Summer School "Groups and Graphs, Algebras and Applications" 04-17 Aug 2025