Cart (Loading....) | Create Account
Close category search window

(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. Letn, k, andtbe positive integers such thatn geq k geq t > 0. An(n, k,t)-covering system is a pair(X, beta), whereXis a set of sizenandbetais a collection of subsets ofX, each of sizek, such that for allT subseteq Xof sizet, there exists at least oneB in betawithTsubseteq B. Letb(n, k, t)denote the smallest size ofbeta, 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 byb(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 )

Date of Publication:

Sep 1981

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.