Title
Generalization of the Norse Bounds to Codes
Document Type
Report
Date
7-1989
Keywords
Coding
Language
English
Disciplines
Computer Sciences
Description/Abstract
The Norse bounds state that all codes (resp. all self-complementary codes) of strength 1 (resp. 2) and length n have covering radius at most n/2 (resp. n-√n / 2). We generalize this to arbitrary even values of strength, still assuming self-complementarity, and to odd strengths without this hypothesis. Our proof techniques are probabilistic.
Recommended Citation
Sole, P. and Mehrotra, Kishan, "Generalization of the Norse Bounds to Codes" (1989). Electrical Engineering and Computer Science - Technical Reports. 58.
https://surface.syr.edu/eecs_techreports/58
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-89-07