MO4.R7.1

Pair-Covering Codes

Avital Boruchovsky, Tuvi Etzion, Eitan Yaakobi, Technion, Israel
Session:
Combinatorial Coding Theory 2
Track:
1: Algebraic Aspects of Coding Theory
Location:
VIP
Presentation Time:
Mon, 8 Jul, 16:25 - 16:45
Session Chair:
Ferdinando Zullo, Universita della Campania
Abstract
Abstract—THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. Motivated by distributed algorithms for fuzzy joins, the concept of edge-covering codes is defined. This definition is a generalization of the well-known concept of covering codes. Basic properties and bounds for the new concept with comparison to the associated properties and bounds for covering codes, are provided. In particular, the sphere covering bound and normal codes are generalized to this new concept
Session MO4.R7
MO4.R7.1: Pair-Covering Codes
Avital Boruchovsky, Tuvi Etzion, Eitan Yaakobi, Technion, Israel
MO4.R7.2: On the Classification of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-Linear Hadamard Codes
Dipak Kumar Bhunia, Cristina Fernández-Córdoba, Mercè Villanueva, Universitat Autònoma de Barcelona, Spain
MO4.R7.3: Endomorphisms of Linear Block Codes
Jonathan Mandelbaum, Sisi Miao, Holger Jäkel, Laurent Schmalen, Karlsruhe Institute of Technology, Germany
MO4.R7.4: Nonlinear Codes with Low Redundancy
SHU LIU, University of Electronic Science and Technology of China, China; CHAOPING XING, Shanghai Jiao Tong University, China
Resources
View Manuscript