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

Revision as of 22:48, 10 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

instance of

scholarly article

0 references

title

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

Information and Computation

0 references

Automata, Languages, and Programming

0 references

publication date

14 June 2018

0 references

27 October 2015

0 references

full work available at URL

https://arxiv.org/abs/1503.01955

0 references

zbMATH Keywords

coding and information theory

0 references

linear codes

0 references

combinatorial codes

0 references

graph theory

0 references

randomized algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A linear time erasure-resilient code with nearly optimal recovery

0 references

Error exponents of expander codes

0 references

Concatenated Codes: Serial and Parallel

0 references

Distance properties of expander codes

0 references

Subspace evasive sets

0 references

Q3293678

0 references

ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk

0 references

List decoding from erasures: bounds and code constructions

0 references

List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition

0 references

Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets

0 references

Linear time encodable and list decodable codes

0 references

Automata, Languages and Programming

0 references

Explicit subspace designs

0 references

Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy

0 references

Improved decoding of Reed-Solomon and algebraic-geometry codes

0 references

Folded codes from function field towers and improved optimal rate list decoding

0 references

List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound

0 references

Local Correctability of Expander Codes

0 references

Linear-time list recovery of high-rate expander codes

0 references

Expander graphs and their applications

0 references

Q5417695

0 references

Ramanujan graphs

0 references

Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators

0 references

Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)

0 references

Q2904764

0 references

Expander codes

0 references

A recursive approach to low complexity codes

0 references

On expander codes

0 references

Identifiers

zbMATH Open document ID

1403.94106

0 references

1403.94105

0 references

DOI

10.1016/j.ic.2018.02.004

0 references

10.1007/978-3-662-47672-7_57

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1640994

@@ Property / cites work @@
+A linear time erasure-resilient code with nearly optimal recovery
+Normal rank
@@ Property / cites work @@
+Error exponents of expander codes
@@ Property / cites work: Error exponents of expander codes / rank @@
+Normal rank
@@ Property / cites work @@
+Concatenated Codes: Serial and Parallel
@@ Property / cites work: Concatenated Codes: Serial and Parallel / rank @@
+Normal rank
@@ Property / cites work @@
+Distance properties of expander codes
@@ Property / cites work: Distance properties of expander codes / rank @@
+Normal rank
@@ Property / cites work @@
+Subspace evasive sets
@@ Property / cites work: Subspace evasive sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3293678
@@ Property / cites work: Q3293678 / rank @@
+Normal rank
@@ Property / cites work @@
+ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk
@@ Property / cites work: ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk / rank @@
+Normal rank
@@ Property / cites work @@
+List decoding from erasures: bounds and code constructions
+Normal rank
@@ Property / cites work @@
+List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
+Normal rank
@@ Property / cites work @@
+Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
+Normal rank
@@ Property / cites work @@
+Linear time encodable and list decodable codes
@@ Property / cites work: Linear time encodable and list decodable codes / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit subspace designs
@@ Property / cites work: Explicit subspace designs / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
+Normal rank
@@ Property / cites work @@
+Improved decoding of Reed-Solomon and algebraic-geometry codes
+Normal rank
@@ Property / cites work @@
+Folded codes from function field towers and improved optimal rate list decoding
+Normal rank
@@ Property / cites work @@
+List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
+Normal rank
@@ Property / cites work @@
+Local Correctability of Expander Codes
@@ Property / cites work: Local Correctability of Expander Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time list recovery of high-rate expander codes
+Normal rank
@@ Property / cites work @@
+Expander graphs and their applications
@@ Property / cites work: Expander graphs and their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417695
@@ Property / cites work: Q5417695 / rank @@
+Normal rank
@@ Property / cites work @@
+Ramanujan graphs
@@ Property / cites work: Ramanujan graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
+Normal rank
@@ Property / cites work @@
+Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
+Normal rank
@@ Property / cites work @@
+Q2904764
@@ Property / cites work: Q2904764 / rank @@
+Normal rank
@@ Property / cites work @@
+Expander codes
@@ Property / cites work: Expander codes / rank @@
+Normal rank
@@ Property / cites work @@
+A recursive approach to low complexity codes
@@ Property / cites work: A recursive approach to low complexity codes / rank @@
+Normal rank
@@ Property / cites work @@
+On expander codes
@@ Property / cites work: On expander codes / rank @@
+Normal rank