MO1.R7.4

Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound

Miao Liu, Chong Shangguan, Shandong University, China
Session:
Combinatorial Coding Theory 1
Track:
1: Algebraic Aspects of Coding Theory
Location:
VIP
Presentation Time:
Mon, 8 Jul, 11:05 - 11:25
Session Chair:
Ago-Erik Riet,
Presentation
Not logged in.
Discussion
Not logged in.
Session MO1.R7
MO1.R7.1: On the existence of some completely regular codes in Hamming graphs
Denis Krotov, Sobolev Institute of Mathematics, Russia
MO1.R7.2: Parity-check matrix for Z/p^s-additive codes: efficient computation
Cristina Fernández-Córdoba, Adrián Torres-Martín, Universitat Autònoma de Barcelona, Spain; Carlos Vela, University of Aveiro, Portugal; Mercè Villanueva, Universitat Autònoma de Barcelona, Spain
MO1.R7.3: Explicit Good Codes Approaching Distance 1 in Ulam Metric
Elazar Goldenberg, The Academic College of Tel Aviv-Yaffo, Israel; Mursalin Habib, Karthik C. S., Rutgers University, United States
MO1.R7.4: Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound
Miao Liu, Chong Shangguan, Shandong University, China
Resources
No resources available.