Coherence of sensing matrices coming from algebraic-geometric codes

DOI10.3934/AMC.2016016zbMath1348.94019OpenAlexW2346128450MaRDI QIDQ326320

Seungkook Park

Publication date: 12 October 2016

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2016016

zbMATH Keywords

coherenceminimum distancecompressed sensingalgebraic-geometric code

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Sampling theory in information and communication theory (94A20)

Cites Work

• Explicit constructions of RIP matrices and related problems
• The complete determination of the minimum distance of two-point codes on a Hermitian curve
• The order bound for general algebraic geometric codes
• Deterministic constructions of compressed sensing matrices
• The two-point codes on a Hermitian curve with the designed minimum distance
• The two-point codes with the designed distance on a Hermitian curve in even characteristic
• Toward the determination of the minimum distance of two-point codes on a Hermitian curve.
• Minimum distance of Hermitian two-point codes
• Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
• Algebraic Function Fields and Codes
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Improvements on parameters of one-point AG codes from Hermitian curves
• The minimum distance of codes in an array coming from telescopic semigroups
• Compressed sensing
• Weierstrass pairs and minimum distance of Goppa codes

This page was built for publication: Coherence of sensing matrices coming from algebraic-geometric codes