NDLI: Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate

Content Provider	IEEE Xplore Digital Library
Author	Guruswami, V. Smith, A.
Copyright Year	2010
Abstract	In this paper, we consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter p and (b) the process which adds the errors can be described by a sufficiently "simple" circuit. Codes for such channel models are attractive since, like codes for standard adversarial errors, they can handle channels whose true behavior is unknown or varying over time. For three classes of channels, we provide explicit, efficiently encodable/decodable codes of optimal rate where only inefficiently decodable codes were previously known. In each case, we provide one encoder/decoder that works for every channel in the class. Unique decoding for additive errors: We give the first construction of a poly-time encodable/decodable code for additive (a.k.a. oblivious) channels that achieve the Shannon capacity 1-H(p). List-decoding for online log-space channels: A space-S(N) bounded channel reads and modifies the transmitted codeword as a stream, using at most S(N) bits of workspace on transmissions of N bits. For constant S, this captures many models from the literature, including "discrete channels with finite memory" and "arbitrarily varying channels". We give an efficient code with optimal rate (arbitrarily close to 1-H(p)) that recovers a short list containing the correct message with high probability for channels which read and modify the transmitted codeword as a stream, using at most O(\log N) bits of workspace on transmissions of N bits. List-decoding for poly-time channels: For any constant c we give a similar list-decoding result for channels describable by circuits of size at most N^c, assuming the existence of pseudorandom generators.
Starting Page	723
Ending Page	732
File Size	659761
Page Count	10
File Format	PDF
ISBN	9781424485253
ISSN	02725428
DOI	10.1109/FOCS.2010.74
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-10-23
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Decoding Additives Stochastic processes Channel coding Automatic voltage control Polynomials computationally bounded channels coding theory information theory adversarial errors pseudorandomness explicit constructions
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Optimal Rate Code Constructions for Computationally Simple Channels

Codes for computationally simple channels: Explicit constructions with optimal rate (2010)

Hitting Sets for Low-Degree Polynomials with Optimal Density

The adversarial joint source-channel problem

Explicit Subspace Designs

Optimal Error Correction for Computationally Bounded Noise

APP decoding of non-binary block codes on Gilbert-Elliott channels using generalized weight polynomials

Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes

Error exponents for channel coding with side information

Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate

Similar Documents

Optimal Rate Code Constructions for Computationally Simple Channels

Codes for computationally simple channels: Explicit constructions with optimal rate (2010)

Hitting Sets for Low-Degree Polynomials with Optimal Density

The adversarial joint source-channel problem

Explicit Subspace Designs

Optimal Error Correction for Computationally Bounded Noise

APP decoding of non-binary block codes on Gilbert-Elliott channels using generalized weight polynomials

Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes

Error exponents for channel coding with side information

Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate