Cyclically covering subspaces and additive perfect codes
cs.IT, math.CO, math.IT, math.NT
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- Smallest cyclically covering subspaces of $\mathbb{F}_q^n$, and lower bounds in Isbell's conjecture
- Discrete Fourier Transform Approach to Cyclically Covering Subspaces of $\mathbb{F}^n_q$
- On cyclically covering subspaces of F n q
- Cyclic codes and cyclically covering subspaces
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound