By Topic

(n,k,t))-covering systems and error-trapping decoding (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

The technique of error-trapping decoding for algebraic codes is studied in combinatorial terms of covering systems. Let n, k , and t be positive integers such that n \geq k \geq t > 0 . An (n, k,t) -covering system is a pair (X, \beta ) , where X is a set of size n and \beta is a collection of subsets of X , each of size k , such that for all T \subseteq X of size t , there exists at least one B \in \beta with T\subseteq B . Let b(n, k, t) denote the smallest size of \beta , such that (X, \beta ) is an (n, k, t) -covering system. It is shown that the complexity of an error-trapping decoding technique is bounded by b(n, k, t) from below. Two new methods for constructing small (n, k, t) -covering systems, the algorithmic method and the difference family method, are given.

Published in:

Information Theory, IEEE Transactions on  (Volume:27 ,  Issue: 5 )