Constructions of Perfect Binary Codes

@inproceedings{evaConstructionsOP,
  title={Constructions of Perfect Binary Codes},
  author={F I Solov 'eva}
}
  • F I Solov 'eva
We consider some constructions of perfect binary codes with the purpose to outline them and present the best known lower and upper bounds on the number of diierent perfect binary codes. Some nontrivial properties of perfect binary codes are discussed. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 36 references

Construction of perfect binary codes by sequential translations of an ~ -components

  • S V Avgustinovich, F I Solov 'eva
  • Problems of Information Transmission
  • 1997

Construction of perfect binary codes by sequential translations of the i-components

  • S V Avgustinovich, F I Solov 'eva
  • Proc. of Fifth Int. Workshop on Algebraic and…
  • 1996

Existence of nonsystematic perfect binary codes

  • S V Avgustinovich, F I Solov 'eva
  • Proc. of Fifth Int. Workshop on Algebraic and…
  • 1996

On the nonsystematic perfect binary codes

  • S V Avgustinovich, F I Solov 'eva
  • Problems of Information Transmission
  • 1996

Interdependence between perfect binary codes and their projections

  • Y L Vasil 'ev, F I Solov 'eva
  • Proc. Seventh Joint Swedish-Russian Workshop on…
  • 1995

On a property of perfect binary codes, Discrete Analysis and Operation Research

  • S V Avgustinovich
  • On a property of perfect binary codes, Discrete…
  • 1995

Similar Papers

Loading similar papers…