Linearized Reed-Solomon codes and linearized Wenger graphs

2015/02/06 by Haode Yan, Chunlei Liu, Yan, Haode +1
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT

paper · pdf · doi:10.48550/arxiv.1502.01885

8 pages

openalex publication_date 2015/02/06 · arxiv created 2015/02/16 · arxiv updated 2015/02/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized polynomials.

Related

• Higher weight distribution of linearized Reed-Solomon codes
• The Partial-Inverse Approach to Linearized Polynomials and Gabidulin Codes With Applications to Network Coding
• Parameterized codes over graphs
• The weight enumerator polynomials of the lifted codes of the projective Solomon-Stiffler codes
• Weight distributions of two classes of linear codes