Optimal Binary Constant Weight Codes and Affine Linear Groups over Finite Fields

2017/07/07 by Xiang‐dong Hou, Hou, Xiang-dong
Computer Science · Engineering · #05B05 #05E18 #94B25 #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Mathematics #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1707.02315

openalex publication_date 2017/07/07 · openalex created_date 2017/07/21 · openalex updated_date 2026/07/28

Abstract

Let AGL(1,\Bbb F_q) be the affine linear group of dimension 1 over a finite field \Bbb F_q. AGL(1,\Bbb F_q) acts sharply 2-transitively on \Bbb F_q. Given S

Related

• Codes from A_m-invariant polynomials
• A Class of Linear Codes with a Few Weights
• A subfield-based construction of optimal linear codes over finite fields
• Minimal Linear Codes over Finite Fields
• Optimal Additive and Linear b-Symbol Codes for Large Distances