Title

Generalization of the Norse Bounds to Codes

Document Type

Report

Date

7-1989

Embargo Period

4-30-2012

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.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-89-07

Source

local

This document is currently not available here.

Share

COinS