ON THE MINIMAL WEIGHT OF BINARY GROUP CODES

Abstract

Let w(n,k) be the largest integer such that there exists a binary group code (n,k) all of whose non-zero elements have weight equal to or larger than w(n,k). In this report values of w(n,k) are given for o< k < or 6 and k < or n < or 100, as well as for o< k < or n < or 24. Further, new upper and lower bounds are obtained which are easy to compute and, in certain regions, better than other known bounds.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1963
Accession Number
AD0407059

Entities

People

  • E. Myrvaagnes
  • L. Calabi

Tags

DTIC Thesaurus Topics

  • Air Force
  • Applied Mathematics
  • Contractors
  • Contracts
  • Department Of Defense
  • Government Procurement
  • Governments
  • Inequalities
  • Information Theory
  • Massachusetts
  • Mathematics
  • Procurement
  • United States
  • Virginia

Fields of Study

  • Mathematics

Readers

  • Computer Programming and Software Development.
  • Operations Research