On quantiles of minimal codeword weights of random linear codes over $\mathbf{F}_p$

DOI10.4213/mvk258zbMath1481.94153OpenAlexW2830444999MaRDI QIDQ3382023

Andrey M. Zubkov, Vasiliy I. Kruglov

Publication date: 20 September 2021

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk258

zbMATH Keywords

quantile estimatesrandom linear codesdistributions of minimal codeword weights

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items

О ранге случайной двоичной матрицы с заданными весами независимых строк, О ранге случайной матрицы над простым полем, состоящей из независимых строк с заданными числами ненулевых элементов

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• A Complete Proof of Universal Inequalities for the Distribution Function of the Binomial Law
• On the inherent intractability of certain coding problems (Corresp.)
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• Статистические характеристики весовых спектров случайных линейных кодов над $\mathrm{GF}(p)$