Coherence of sensing matrices coming from algebraic-geometric codes | Zendy

Seungkook Park | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Coherence of sensing matrices coming from algebraic-geometric codes

Author(s) -

Seungkook Park

Publication year - 2016

Publication title -

advances in mathematics of communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.601

H-Index - 26

eISSN - 1930-5346

pISSN - 1930-5338

DOI - 10.3934/amc.2016016

Subject(s) - compressed sensing , mutual coherence , mathematics , hermitian matrix , coherence (philosophical gambling strategy) , upper and lower bounds , algebraic number , matrix (chemical analysis) , algorithm , discrete mathematics , combinatorics , pure mathematics , mathematical analysis , statistics , materials science , composite material

Compressed sensing is a technique which is to used to reconstruct a sparse signal given few measurements of the signal. One of the main problems in compressed sensing is the deterministic construction of the sensing matrix. Li et al. introduced a new deterministic construction via algebraic-geometric codes (AG codes) and gave an upper bound for the coherence of the sensing matrices coming from AG codes. In this paper, we give the exact value of the coherence of the sensing matrices coming from AG codes in terms of the minimum distance of AG codes and deduce the upper bound given by Li et al. We also give formulas for the coherence of the sensing matrices coming from Hermitian two-point codes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research