COHERENCE OF SENSING MATRICES COMING FROM ALGEBRAIC-GEOMETRIC CODESopen access
- Authors
- Park, Seungkook
- Issue Date
- May-2016
- Publisher
- AMER INST MATHEMATICAL SCIENCES-AIMS
- Keywords
- Compressed sensing; coherence; algebraic-geometric code; minimum distance
- Citation
- ADVANCES IN MATHEMATICS OF COMMUNICATIONS, v.10, no.2, pp 429 - 436
- Pages
- 8
- Journal Title
- ADVANCES IN MATHEMATICS OF COMMUNICATIONS
- Volume
- 10
- Number
- 2
- Start Page
- 429
- End Page
- 436
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/9820
- DOI
- 10.3934/amc.2016016
- ISSN
- 1930-5346
1930-5338
- Abstract
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 이과대학 > 수학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.