On the number of error correcting codes

IF 0.9 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Combinatorics, Probability & Computing Pub Date : 2023-06-09 DOI:10.1017/s0963548323000111

Dingding Dong, Nitya Mani, Yufei Zhao

引用次数: 0

Abstract

Abstract We show that for a fixed $q$ , the number of $q$ -ary $t$ -error correcting codes of length $n$ is at most $2^{(1 + o(1)) H_q(n,t)}$ for all $t \leq (1 - q^{-1})n - 2\sqrt{n \log n}$ , where $H_q(n, t) = q^n/ V_q(n,t)$ is the Hamming bound and $V_q(n,t)$ is the cardinality of the radius $t$ Hamming ball. This proves a conjecture of Balogh, Treglown, and Wagner, who showed the result for $t = o(n^{1/3} (\log n)^{-2/3})$ .

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

关于纠错码的数目

摘要对于一个固定的$q$，对于所有$t \leq (1 - q^{-1})n - 2\sqrt{n \log n}$，长度为$n$的$q$ -任意$t$ -纠错码的数量最多为$2^{(1 + o(1)) H_q(n,t)}$，其中$H_q(n, t) = q^n/ V_q(n,t)$为Hamming界，$V_q(n,t)$为半径$t$的Hamming球的基数。这证明了巴洛格、特雷格伦和瓦格纳的一个猜想，他们在$t = o(n^{1/3} (\log n)^{-2/3})$上给出了结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Combinatorics, Probability & Computing 数学-计算机：理论方法

CiteScore

2.40

自引率

11.10%

发文量

审稿时长

6-12 weeks

期刊介绍： Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

期刊最新文献

Spanning trees in graphs without large bipartite holes Approximate discrete entropy monotonicity for log-concave sums A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree Mastermind with a linear number of queries On oriented cycles in randomly perturbed digraphs