arXiv 1709.045822017-09-14cs.ITmath.IT

Pisano period codes

Minjia Shi, Zhongyi Zhang, Patrick Sole

备注：: 10 pages, submitted on 9th, September

英文摘要：

The cyclic codes with parity check polynomial the reciprocal of the characteristic polynomial of the Fibonacci recurrence over a prime finite field are shown to have either one weight or two weights. When these codes are irreducible cyclic we obtain many counterexamples to the conjectural classification of two-weight irreducible cyclic codes of Schmidt and White (2002). When they are reducible and projective their duals are uniformly packed.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

通过周期马尔可夫过程的恒定权重极化码

Constant Weight Polar Codes through Periodic Markov Processes

本文证明固定周期马尔可夫链的初始状态可使极化发生，从而构造恒定权重极化码，解决了先前一般情形下极化不发生的限制。

2025-01-21cs.ITmath.IT

二进制和非二进制自双序列及最大周期单轨格雷码

Binary and Non-Binary Self-Dual Sequences and Maximum Period Single-Track Gray Codes

Technion-Israel Institute of Technology（以色列理工学院）

本文研究二进制和非二进制自双序列的结构与递归构造，探讨其与最大周期单轨码的关系，提出新的无限族最大周期单轨格雷码构造方法。

2026-06-29cs.ITmath.IT

On period polynomials of degree $2^m$ and weight distributions of certain irreducible cyclic codes

We explicitly determine the values of reduced cyclotomic periods of order $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. These evaluations are applied to obtain explicit factorizations of the corresponding reduced period polynomials. As another application, the weight distributions of certain irreducible cyclic codes are described.

2018-01-01cs.ITmath.ITmath.NT

二进制码与序贯动力系统的周期2轨道

Binary Codes and Period-2 Orbits of Sequential Dynamical Systems

本文证明序贯动力系统在完全图上的周期2轨道最大数等于长度为n-1、最小距离至少为3的二元码的最大码字数，首次给出了该编码序列的新解释。

2017-09-30cs.ITmath.COmath.IT

由整数矩阵生成的码的重量枚举式周期性

Periodicity of weight enumerators for codes generated by an integral matrix

Institute of Mathematics for Industry, Kyushu University（九州大学产业数学研究所）；Department of Mathematics, Nagoya Institute of Technology（名古屋工业大学数学系）；Institute for Chemical Reaction Design and Discovery, Hokkaido University（北海道大学化学反应设计与发现研究所）

本文研究了由整数矩阵生成的码的重量枚举式周期性，通过拟多项式方法计算最小重量并推导出图论拟多项式与重量枚举式之间的转换公式。

2026-09-14cs.ITmath.COmath.IT

A class of linear codes with few weights

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of the linear codes obtained are optimal or almost optimal with respect to the Griesmer bound. As s applications, these linear codes can be used to construct secret sharing schemes with nice access structures.

2018-11-23cs.ITmath.IT

更多相关论文收起更多论文

微重力平台可靠通信的纠错码

Error-Correcting Codes for Reliable Communications in Microgravity Platforms

State University of Londrina（朗德里纳州立大学）

针对火箭发射微重力平台通信中再入段数据丢失问题，提出数字喷泉码与里德-所罗门块码结合的纠错方案，基于Cumã II遥测数据建模信道并仿真，结果表明可恢复几乎所有遥测数据。

2012-01-09cs.ITcs.SYeess.SY

On Skew Convolutional and Trellis Codes

Two new classes of skew codes over a finite field $\F$ are proposed, called skew convolutional codes and skew trellis codes. These two classes are defined by, respectively, left or right sub-modules over the skew fields of fractions of skew polynomials over $\F$. The skew convolutional codes can be represented as periodic time-varying ordinary convolutional codes. The skew trellis codes are in general nonlinear over $\F$. Every code from both classes has a code trellis and can be decoded by Viterbi or BCJR algorithms.

2021-02-02cs.ITmath.IT

两类线性码的权重分布

Weight distributions of two classes of linear codes

本文基于定义集构造两类至多六重权的线性码，用高斯周期和Weil和确定权重分布，得到几乎最优或最优码，并可用于秘密共享方案。

2024-12-18cs.ITmath.IT

GF(2)上$x^h + x + 1$的周期

The period of $x^h + x + 1$ over GF(2)

针对GF(2)上具有高效实现优势的三项式$x^h+x+1$，本文突破了现有依赖计算机计算有限$h$值的局限，推导出其在无限$h$值集合下周期的闭式表达式。

2024-08-27cs.ITmath.IT

How many weights can a cyclic code have ?

Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension and alphabet are given. An application to irreducible cyclic codes is considered. Sharper upper bounds are given for the special cyclic codes (called here strongly cyclic), {whose nonzero codewords have period equal to the length of the code}. Asymptotics are derived on the function $Γ(k,q),$ {that is defined as} the largest number of nonzero weights a cyclic code of dimension $k$ over $\F_q$ can have, and an algorithm to compute it is sketched. The nonzero weights in some infinite families of R…

2018-11-15cs.ITmath.IT

The b-symbol weight distribution of irreducible cyclic codes and related consequences

The $b$-symbol read channel is motivated by the limitations of the reading process in high density data storage systems. The corresponding new metric is a generalization of the Hamming metric known as the $b$-symbol weight metric and has become an important object in coding theory. In this paper, the general $b$-symbol weight enumerator formula for irreducible cyclic codes is presented by using the Gaussian period and a new invariant $\#U(b,j,N_1)$. The related $b$-symbol weight hierarchies $\{d_1(\C),d_2(\C),\ldots,d_K(\C)\}$ ($K=\dim(\C)$) are given for some cases. The shortened codes which …

2022-03-22cs.ITmath.IT

基于空间耦合准循环LDPC码的存储器高效译码器

Memory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes

在本文中，我们提出了空间耦合低密度奇偶校验（SC-LDPC）码的建设周期时变准循环（QC）算法。基于QC的方法被优化以在解码器中存储奇偶校验矩阵时获得存储器效率。为Xilinx FPGA设计了奇偶校验存储单元的硬件模型，比较了各种方法的逻辑和存储器需求。结果表明，所提出的QC SC-LDPC码（优化）可以存储在合理的逻辑资源，而不需要在FPGA中的块存储器。此外，还实现了处理速度的显著提高。

2013-10-17cs.ITmath.IT

Zak-OTFS与LDPC码

Zak-OTFS and LDPC Codes

本文研究Zak-OTFS与LDPC码结合，利用DD域高可靠信道估计先验信息配置LDPC码，仿真表明该方法扩展了无模型可靠通信的多普勒扩展范围，降低了对发送滤波器的敏感性，并放大了未编码传输的BER性能增益。

2024-02-14cs.ITeess.SPmath.IT

偶数长和重量为3的最优强避免冲突码

Optimal strongly conflict-avoiding codes of even length and weight three

在时隙异步多址冲突信道中，采用强冲突避免码（SCAC），保证每个活动用户在固定时间内，在最坏情况下至少成功发送一个分组。假设所有用户被分配不同的码字，SCAC中的码字的数量等于可以支持的潜在用户的数量。SCAC具有不同的组合结构相比，避免冲突的代码（CAC），由于额外的冲突引起的部分重叠传输。在本文中，我们建立了上界的大小为偶数长度和重量三SCACs。此外，它表明，一些最佳的CAC可以用来构造最佳的SCACs的重量为3。

2014-11-11cs.ITmath.COmath.IT