The bilateral minimum distance of a binary linear code is the maximum $d$ such that all nonzero codewords have weights between $d$ and $n-d$. Let $Q\subset \{0,1\}^n$ be a binary linear code whose dual has bilateral minimum distance at least $d$, where $d$ is odd. Roughly speaking, we show that the average $L_\infty$-distance -- and consequently the $L_1$-distance -- between the weight distribution of a random cosets of $Q$ and the binomial distribution decays quickly as the bilateral minimum distance $d$ of the dual of $Q$ increases. For $d = Θ(1)$, it decays like $n^{-Θ(d)}$. On the other $d=Θ(n)$ extreme, it decays like and $e^{-Θ(d)}$. It follows that, almost all cosets of $Q$ have weight distributions very close to the to the binomial distribution. In particular, we establish the following bounds. If the dual of $Q$ has bilateral minimum distance at least $d=2t+1$, where $t\geq 1$ is an integer, then the average $L_\infty$-distance is at most $\min\{\left(e\ln{\frac{n}{2t}}\right)^{t}\left(\frac{2t}{n}\right)^{\frac{t}{2} }, \sqrt{2} e^{-\frac{t}{10}}\}$. For the average $L_1$-distance, we conclude the bound $\min\{(2t+1)\left(e\ln{\frac{n}{2t}}\right)^{t} \left(\frac{2t}{n}\right)^{\frac{t}{2}-1},\sqrt{2}(n+1)e^{-\frac{t}{10}}\}$, which gives nontrivial results for $t\geq 3$. We given applications to the weight distribution of cosets of extended Hadamard codes and extended dual BCH codes. Our argument is based on Fourier analysis, linear programming, and polynomial approximation techniques.
Weight distributions of cosets of weight 2 of the generalized doubly extended Reed-Solomon codes
Kharkevich Institute for Information Transmission Problems Russian Academy of Sciences(俄罗斯科学院赫瓦斯基信息传输问题研究所);Department of Mathematics and Computer Science, University of Perugia(佩鲁贾大学数学与计算机科学系)
A Structural Characterization of Cyclotomic Cosets with Applications to Affine-Invariant Codes and BCH Codes
Hubei University(湖北大学);Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University(湖北大学数学与统计学院应用数学湖北省重点实验室);Key Laboratory of Intelligent Sensing System and Security (Hubei University), Ministry of Education(教育部智能感知系统与安全性重点实验室(湖北大学))
Breaking the bicycle frame: Coset-based quantum LDPC codes
University of Maryland, College Park(马里兰大学帕克分校);Tel Aviv University(特拉维夫大学);Joint Center for Quantum Information and Computer Science, NIST/University of Maryland, College Park(量子信息与计算机科学联合中心,美国国家标准与技术研究院/马里兰大学帕克分校)
Improved Rate-versus-Distance Upper Bounds for LDPC Codes
Research Center for Mathematics and Interdisciplinary Sciences, Shandong University(山东大学数学与交叉科学研究中心);Frontiers Science Center for Nonlinear Expectations, Ministry of Education(教育部非线性预期前沿科学中心)