位置：成果数据库 > 期刊 > 期刊详情页
Enumeration and construction of additive cyclic codes over Galois rings
  • ISSN号：0012-365X
  • 期刊名称：Discrete Mathematics
  • 时间：2015
  • 页码：922-937
  • 相关项目：线性网络纠错码的构造算法与性能分析
作者： Yonglin Cao*|Jian Gao|Fang-Wei Fu|Yuan Cao|
同期刊论文项目
线性网络纠错码的构造算法与性能分析
期刊论文 33 会议论文 5
同项目期刊论文
Unique decoding of certain Reed-Solomon codes
Bounds on quasi-cyclic codes over finite chain rings
广义Reed-Solomon码的深洞
1-generator generalized quasi-cyclic codes over Z4
On the locality and availability of linear codes based on finite geometry
Complete weight enumerators of some cyclic codes
Some results on cyclic codes over Zq+uZq
1-generator quasi-cyclic codes over Fpm+uFpm+...+u^{s-1}Fpm
Note on support weight distribution of linear codes over Fp+uFp
Some results on linear codes over Fp+uFp+u^2Fp
On the Optimality of Secure Network Coding
Linear codes and (1+uv)-constacyclic codes over R[v]/(v2+v)
A Chinese remainder theorem approach to skew generalized quasi-cyclic codes over finite fields
Improved results of impossible differential cryptanalysis on reduced FOX,
Semisimple multivariable Fq-linear codes over Fql
Small field size for secure network coding
Some results on generalized quasi-cyclic codes over Fq+uFq
A note on two-dimensional optical orthogonal codes
Note on quasi-twisted codes and an application
Multiple impossible differential cryptanalysis on reduced FOX
Stopping sets of algebraic geometry codes