Cyclically covering subspaces and additive perfect codes
Yangcheng Li, Pingzhi Yuan
Abstract
Let hq(n) be the largest codimension of a subspace of Fqn whose cyclic shifts cover the whole space. For r>0, we characterize the inequality hq(n) r in terms of cyclic Fq-linear codes over vector alphabets with covering radius one, no nonzero word of block weight one, and a scalar dual generated by the shifts of one word. For k,m2, let Iq(j) count the monic irreducible polynomials of degree j over Fq. If k is prime or m2Σj=1k-1Iq(j)+2, we prove that a cyclic Fq linear perfect code of length qkm-1qk-1 over Fqk exists if and only if (m,q-1)=1. When this condition holds, we also obtain \(hq\!(qkm-1qk-1)=k(m-1).\) Restriction of scalars gives the same criterion for every m2 when q is odd, q+1 is a power of two, and k=2p with p prime. We also show that hq(qk+1)=k exactly when q is even, for every k1.
Create a lesson
Related papers
Optimal Preemption: Guaranteeing Information Freshness in Mean Age and Beyond
Aimin Li, Yiğit İnce, Elif Uysal
Spherical Tessellation of Circular Arrays for Massive MIMO: Favourable Propagation Conditions and Spectral Design
Geili T A El Sanousi, Tuan Anh Le, Raed A A Abd-Alhameed et al.
Physics-Informed Deep Learning for Channel Prediction in Satellite-Mounted Metasurface Reflection Communication Networks
Aolin Sun, Ruihong Jiang, Jincong Mo et al.
Two-Timescale Channel Estimation and Port Selection for Fluid Antenna Systems With Limited Port Observations
Xusheng Zhu, Kai-Kit Wong, Jiajian Wang et al.
Asymptotic Bounds for Codes in Toroidal Distance
Pengjie Zhong, Jinquan Luo
Feedback-Free FDD Cell-Free Massive MIMO With Sparse AP Activation and Dual-Mode Precoding
Wei Jiang, Hans Dieter Schotten