Near orders and codes
C. Carvalho, C. Munuera, E. Silva, F. Torres
Abstract
Hoholdt, van Lint and Pellikaan used order functions to construct codes by means of Linear Algebra and Semigroup Theory only. However, Geometric Goppa codes that can be represented by this method are mainly those based on just one point. In this paper we introduce the concept of near order function with the aim of generalize this approach in such a way that a of wider family of Geometric Goppa codes can be studied on a more elementary setting.
Create a lesson
Related papers
An Explicit Family of Log-Concave Counterexamples to the Gaussian Completely Monotone Conjecture
Jiayang Zou, Luyao Fan, Jiayang Gao et al.
Strengthening Recursive Constructions for Zero-Error Shannon Capacity
Ravi Tandon
Fluid Antenna Multiple Access for Noise Modulation
Hadi Zayyani, Felipe A. P. de Figueiredo
The generalized covering radii of Melas codes
Shuxing Li, Maosheng Xiong
Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance
Antonio Jesús Lorite-López, Daniel Camazón-Portela, Juan Antonio López-Ramos
Multi-Access Speculative Inference: Uplink or Downlink?
Chang Cai, Kaibin Huang