Extendability of Ternary Linear Codes

Extendability of Ternary Linear Codes
复制标题

三进制线性码的可扩展性

DOI:
10.1007/s10623-005-6400-7
复制
发表时间:
2005
期刊:
Designs, Codes and Cryptography
影响因子:
--
通讯作者:
T. Maruta
T. Maruta
中科院分区:
--
文献类型:
--
作者:
T. Maruta

文献摘要

被引文献

相似文献

对于维数k≥3,最小距离为gcd(3,d) = 1的三元线性码总是可扩展的,存在四种分集。并且,当≡1 (mod 3)时,其中3个具有双可扩展性。对于维数为3≤k≤6的三元线性码,发现了所有的多样性。给出了一种从生成矩阵求扩展的算法。
There are four diversities for which ternary linear codes of dimensionk≥ 3, minimum distancedwith gcd(3,d) = 1 are always extendable. Moreover, three of them yield double extendability whend≡ 1 (mod 3). All the diversities are found for ternary linear codes of dimension 3 ≤k≤ 6. An algorithm how to find an extension from a generator matrix is also given.