<p>In this paper, we study a class of subcodes of codimension 1 in the <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\([n,k+1]_q\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo>,</mo> <mi>k</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">]</mo> </mrow> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation> generalized Reed-Solomon (GRS) codes, whose generator matrix is derived by removing the row of degree <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(k-r\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>-</mo> <mi>r</mi> </mrow> </math></EquationSource> </InlineEquation> from the generator matrix of the <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\([n,k+1]_q\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo>,</mo> <mi>k</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">]</mo> </mrow> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation> GRS codes, where <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(1 \le r \le k-1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>≤</mo> <mi>r</mi> <mo>≤</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. We show equivalent characterizations for this class of subcodes of the GRS codes being self-dual or near-MDS, which extends the results for <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(r=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>r</mi> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> in the literature. Along with these characterizations, families of self-dual near-MDS subcodes of the GRS codes are also proposed. Finally, for <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(r = 1,2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>r</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, the dual codes of the subcodes of the GRS codes are found out. In some cases, the subcodes of the GRS codes can be closed under taking dual codes. In other cases, the dual codes turn out to be the twisted GRS codes.</p>

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

On subcodes of the generalized Reed-Solomon codes

  • Yu Ning

摘要

In this paper, we study a class of subcodes of codimension 1 in the \([n,k+1]_q\) [ n , k + 1 ] q generalized Reed-Solomon (GRS) codes, whose generator matrix is derived by removing the row of degree \(k-r\) k - r from the generator matrix of the \([n,k+1]_q\) [ n , k + 1 ] q GRS codes, where \(1 \le r \le k-1\) 1 r k - 1 . We show equivalent characterizations for this class of subcodes of the GRS codes being self-dual or near-MDS, which extends the results for \(r=1\) r = 1 in the literature. Along with these characterizations, families of self-dual near-MDS subcodes of the GRS codes are also proposed. Finally, for \(r = 1,2\) r = 1 , 2 , the dual codes of the subcodes of the GRS codes are found out. In some cases, the subcodes of the GRS codes can be closed under taking dual codes. In other cases, the dual codes turn out to be the twisted GRS codes.