2009
DOI: 10.1201/9781584888239-c18
|View full text |Cite
|
Sign up to set email alerts
|

Applications of FFT and Structured Matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 90 publications
0
1
0
Order By: Relevance
“…An n×m Toeplitz matrix is completely determined by the n + m − 1 elements on its first row and column. This structure implies that only O(n log n) time for encoding is required for this subclass of RLCs [38]. Additionally, these codes also asymptotically approach the GV bound (see Supplementary Material for a proof).…”
Section: Error-correcting Codementioning
confidence: 84%
“…An n×m Toeplitz matrix is completely determined by the n + m − 1 elements on its first row and column. This structure implies that only O(n log n) time for encoding is required for this subclass of RLCs [38]. Additionally, these codes also asymptotically approach the GV bound (see Supplementary Material for a proof).…”
Section: Error-correcting Codementioning
confidence: 84%