<p>Constant dimension codes (CDCs), as special subspace codes, have received extensive attention due to their applications in random network coding. The basic problem of CDCs is to determine the maximal possible size <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(A_q(n,d,k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>A</mi> <mi>q</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>d</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> of CDCs for given parameters <i>q</i>,&#xa0;<i>n</i>,&#xa0;<i>d</i>, and <i>k</i>. This paper introduces criteria for choosing appropriate bilateral identifying vectors compatible with the parallel mixed dimension construction. We then utilize the generalized bilateral multilevel construction to improve the parallel mixed dimension construction efficiently. Many new CDCs that are better than the previously best-known codes are constructed.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction

  • Han Li,
  • Fang-Wei Fu

摘要

Constant dimension codes (CDCs), as special subspace codes, have received extensive attention due to their applications in random network coding. The basic problem of CDCs is to determine the maximal possible size \(A_q(n,d,k)\) A q ( n , d , k ) of CDCs for given parameters qnd, and k. This paper introduces criteria for choosing appropriate bilateral identifying vectors compatible with the parallel mixed dimension construction. We then utilize the generalized bilateral multilevel construction to improve the parallel mixed dimension construction efficiently. Many new CDCs that are better than the previously best-known codes are constructed.