Reliable Computations Based on Locally Decodable Codes

Lecture Notes in Computer Science - Germany
doi 10.1007/11672142_44
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Towards 3-Query Locally Decodable Codes of Subexponential Length

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2008English

Three-Query Locally Decodable Codes With Higher Correctness Require Exponential Length

ACM Transactions on Computation Theory
Computational TheoryTheoretical Computer ScienceMathematics
2012English

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2006English

MacNeish–Mann Theorem Based Iteratively Decodable Codes for Optical Communication Systems

IEEE Communications Letters
Electronic EngineeringSimulationComputer Science ApplicationsElectricalModeling
2004English

Multiway Physical-Layer Network Coding via Uniquely Decodable Codes

Wireless Communications and Mobile Computing
Computer NetworksElectronic EngineeringInformation SystemsElectricalCommunications
2018English

A Fast-Decodable Code Structure for Linear Dispersion Codes

IEEE Transactions on Wireless Communications
Electronic EngineeringApplied MathematicsComputer Science ApplicationsElectrical
2009English

On Matrix Rigidity and Locally Self-Correctable Codes

2010English

Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1999English

Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder Channel

IBM Journal of Research and Development
Computer Science
1980English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy