arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0806.4979cs.ITmath.IT
收藏

基于图论的码的界

Bounds on Codes Based on Graph Theory

Salim Y. El Rouayheb, C. N. Georghiades, E. Soljanin, A. Sprintson

摘要:

令$A_q(n,d)$为长度为$n$且汉明距离至少为$d$的$q$元码的最大阶数(码字的最大数目)。并设$A(n,d,w)$为等重二进制码$w$。建立在结果代数图论和Erdens-ko-Rado像极值组合定理,我们展示了如何几个已知的界限$A_q(n,d)$和$A(n,d,w)$可以很容易地在一个单一的框架。例如,Hamming和Singleton界都可以作为与顶点传递图的团数和独立数相关的性质的应用而导出。使用相同的技术,我们也得到了一些新的界限,并提出了一些额外的应用。

英文摘要:

Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph theory and Erdős-ko-Rado like theorems in extremal combinatorics, we show how several known bounds on $A_q(n,d)$ and $A(n,d,w)$ can be easily obtained in a single framework. For instance, both the Hamming and Singleton bounds can derived as an application of a property relating the clique number and the independence number of vertex transitive graphs. Using the same techniques, we also derive some new bounds and present some additional applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑