Graph Theoretic Methods in Coding Theory
Chapter

 Overview

 Identity

 Additional Document Info

 View All

Overview
abstract

© Springer Science+Business Media, LLC 2012. All rights reserved. Let Σ q ={0,1,…, q?1} be an alphabet of order q. A qary (unrestricted) code C of length n and size  C  is a subset of Σqn containing  C  elements called codewords. The Hamming weight wt(c) of a codeword c is the number of its nonzero entries. A constantweight code is a code where all the codewords have the same Hamming weight. The Hamming distance d(c, c ’) between two codewords c and c’ is the number of positions where they have different entries. The minimum Hamming distance of a code C is the largest integer Δ such that ∀, c? ∈ C, d(c, c?) ≥ Δ.
author list (cited authors)

Rouayheb, S. E., & Georghiades, C. N.
Book Title

Classical, Semiclassical and Quantum Noise
publication date
publisher
Identity
Digital Object Identifier (DOI)
International Standard Book Number (ISBN) 13
Additional Document Info