Linear-time list recovery of high-rate expander codes (Q1640994): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Linear-Time List Recovery of High-Rate Expander Codes
description / endescription / en
scientific article
scientific article; zbMATH DE number 6498684
Property / title
 
Linear-Time List Recovery of High-Rate Expander Codes (English)
Property / title: Linear-Time List Recovery of High-Rate Expander Codes (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1403.94105 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-47672-7_57 / rank
 
Normal rank
Property / published in
 
Property / published in: Automata, Languages, and Programming / rank
 
Normal rank
Property / publication date
 
27 October 2015
Timestamp+2015-10-27T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 27 October 2015 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6498684 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2790601937 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963787959 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.01955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time erasure-resilient code with nearly optimal recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error exponents of expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concatenated Codes: Serial and Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance properties of expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace evasive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3293678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: List decoding from erasures: bounds and code constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time encodable and list decodable codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit subspace designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved decoding of Reed-Solomon and algebraic-geometry codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Folded codes from function field towers and improved optimal rate list decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Correctability of Expander Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time list recovery of high-rate expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive approach to low complexity codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local correctability of expander codes / rank
 
Normal rank

Latest revision as of 22:02, 15 July 2024

scientific article; zbMATH DE number 6498684
  • Linear-Time List Recovery of High-Rate Expander Codes
Language Label Description Also known as
English
Linear-time list recovery of high-rate expander codes
scientific article; zbMATH DE number 6498684
  • Linear-Time List Recovery of High-Rate Expander Codes

Statements

Linear-time list recovery of high-rate expander codes (English)
0 references
Linear-Time List Recovery of High-Rate Expander Codes (English)
0 references
0 references
0 references
14 June 2018
0 references
27 October 2015
0 references
coding and information theory
0 references
linear codes
0 references
combinatorial codes
0 references
graph theory
0 references
randomized algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references