The Minimum Hamming Distance of Cyclic Codes of Length 2p~8

机译：长度为2p〜8的循环码的最小汉明距离

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
引文网络
相似文献
相关主题

摘要

We study cyclic codes of length 2p~8 over F_q, where p is an odd prime. Using the results of [1], we compute the minimum Hamming distance of these codes.

机译：我们研究在F_q上长度为2p〜8的循环码，其中p是奇质数。使用[1]的结果，我们计算出这些代码的最小汉明距离。

著录项

来源
《Applied algebra, algebraic algorithms, and error-correcting codes》|2009年|P.92-100|共9页
会议地点 Tarragona(ES);Tarragona(ES)
作者
Hakan OEzadam; Ferruh OEzbudak;
展开▼
作者单位

Department of Mathematics and Institute of Applied Mathematics Middle East Technical University, Inoenue Bulvari, 06531, Ankara, Turkey;

rnDepartment of Mathematics and Institute of Applied Mathematics Middle East Technical University, Inoenue Bulvari, 06531, Ankara, Turkey;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类运算器和控制器（CPU）;
关键词
cyclic code; repeated-root cyclic code; hamming distance;

机译：循环码重复根循环码；汉明距离;

相似文献

外文文献
中文文献
专利

1. The minimum Hamming distances of the irreducible cyclic codes of length l_1~(m_1) l_2~(m_2) ... l_r~(m_r) [J] . Manju Pruthi, Pankaj Journal of Discrete Mathematical Sciences and Cryptography . 2016,第5a6期

机译：长度为l_1〜（m_1）l_2〜（m_2）... l_r〜（m_r）的不可约循环码的最小汉明距离
2. Hamming distance of repeated-root constacyclic codes of length 2p(s) over F-pm + uF(pm) [J] . Dinh Hai Q., Gaur A., Gupta Indivar, Applicable algebra in engineering, communication and computing . 2020,第3a4期

机译：F-PM + UF（PM）中长度2P的重复根系统码的汉明距离
3. A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes [J] . Alexander Zeh, Sergey Bezzateev Designs, Codes and Crytography . 2014,第2期

机译：使用小最小距离循环码的循环码最小距离的新界限
4. The Minimum Hamming Distance of Cyclic Codes of Length 2p~s [C] . Hakan Ozadam, Ferruh Ozbudak International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes . 2009

机译：长度2p〜s的循环码的最小汉明距离
5. High code rate, low-density parity-check codes with guaranteed minimum distance and stopping weight. [D] . Miller, John Andrew. 2003

机译：高码率，低密度奇偶校验码，保证最小距离和停止重量。
6. Minimum Description Length Codes Are Critical [O] . Ryan John Cubero, Matteo Marsili, Yasser Roudi 2018

机译：最小描述长度代码至关重要
7. A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes [O] . Alexander Zeh, Sergey Bezzateev 2012

机译：基于maTLaB的循环码最小距离的新界小最小距离循环码
8. On the Minimum Distance Structure of Cyclic Codes and Decoding Beyond the Bch Bound [R] . Hartmann, C. R. P. 1970

机译：关于循环码的最小距离结构和超出Bch界限的解码

The Minimum Hamming Distance of Cyclic Codes of Length 2p~8

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅