Sciweavers

84 search results - page 11 / 17
» Algebraic Constructions of Space-Frequency Codes
Sort
View
ICSE
1997
IEEE-ACM
13 years 11 months ago
Assessing Modular Structure of Legacy Code Based on Mathematical Concept Analysis
We apply mathematical concept analysis in order to modularize legacy code. By analysing the relation between procedures and global variables, a so-called concept lattice is constr...
Christian Lindig, Gregor Snelting
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 7 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
ICC
2008
IEEE
125views Communications» more  ICC 2008»
14 years 1 months ago
Cell Search for Cell-Based OFDM Systems Using Quasi Complete Complementary Codes
Abstract—Establishing a radio link in cell-based mobile communication systems involves searching and synchronizing the downlink known pattern of sequences associated with the bas...
Chao-Yu Chen, Ying-Ju Min, Kuei-Ying Lu, Chi-Chao ...
STOC
2009
ACM
187views Algorithms» more  STOC 2009»
14 years 7 months ago
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
Venkatesan Guruswami
ICASSP
2010
IEEE
13 years 6 months ago
Circulant space-time codes for integration with beamforming
—This paper provides a framework for designing space-time codes to take advantage of a small number of feedback bits from the receiver. The new codes are based on circulant matri...
Yiyue Wu, A. Robert Calderbank