Overview

coding bounds


Show Summary Details

Quick Reference

A variety of inequalities that apply, generally or specifically, to error-detecting and error-correcting codes, setting bounds to their performance as expressed by parameters such as the number of codewords (see block code), minimum Hamming distance, codeword length, and efficiency. Of the many bounds that are known, the most important are the Hamming bound and the Gilbert-Varshamov bound.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.