S-Fr-2.3: ON THE DETERMINISTIC CODE CAPACITY REGION OF AN ARBITRARILY VARYING MULTIPLE-ACCESS CHANNEL UNDER LIST DECODING (English)
- New search for: Nitinawarat, S.
- New search for: Nitinawarat, S.
In:
IEEE International Symposium on Information Theory
;
290-294
;
2010
-
ISBN:
- Conference paper / Print
-
Title:S-Fr-2.3: ON THE DETERMINISTIC CODE CAPACITY REGION OF AN ARBITRARILY VARYING MULTIPLE-ACCESS CHANNEL UNDER LIST DECODING
-
Contributors:Nitinawarat, S. ( author )
-
Conference:IEEE International Symposium on Information Theory ; 2010 ; Austin, TX
-
Published in:
-
Publisher:
- New search for: Curran
-
Place of publication:New York
-
Publication date:2010-01-01
-
Size:5 pages
-
Remarks:Includes bibliographical references and index.
-
ISBN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
-
Keywords:
-
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
S-Mo-1.1: UNIVERSAL SOURCE CODING FOR MULTIPLE DECODERS WITH SIDE INFORMATIONKuzuoka, S. / Kimura, A. / Uyematsu, T. et al. | 2010
- 6
-
S-Mo-1.2: ROBUST MULTIRESOLUTION CODING WITH HAMMING DISTORTION MEASUREChen, J. / Dumitrescu, S. / Zhang, Y. / Wang, J. et al. | 2010
- 11
-
S-Mo-1.3: ON ZERO-ERROR SOURCE CODING WITH FEEDBACKBakshi, M. / Effros, M. et al. | 2010
- 16
-
S-Mo-1.4: RATE DISTORTION WITH SIDE-INFORMATION AT MANY RECEIVERSTimo, R. / Chan, T. / Grant, A. et al. | 2010
- 21
-
S-Mo-2.1: THE GENERALIZED QUADRATIC GAUSSIAN CEO PROBLEM: NEW CASES WITH TIGHT RATE REGION AND APPLICATIONSYang, Y. / Zhang, Y. / Xiong, Z. et al. | 2010
- 26
-
S-Mo-2.2: SUM RATE OF THE VACATIONING CEO PROBLEMSoundararajan, R. / Wagner, A. / Vishwanath, S. et al. | 2010
- 31
-
S-Mo-2.3: CASCADE AND TRIANGULAR SOURCE CODING WITH SIDE INFORMATION AT THE FIRST TWO NODESPermuter, H. / Weissman, T. et al. | 2010
- 36
-
S-Mo-2.4: ON THE EXCESS DISTORTION EXPONENT OF THE QUADRATIC-GAUSSIAN WYNER-ZIV PROBLEMKochman, Y. / Wornell, G.W. et al. | 2010
- 41
-
S-Mo-3.1: ON THE SUM-RATE LOSS OF QUADRATIC GAUSSIAN MULTITERMINAL SOURCE CODINGYang, Y. / Zhang, Y. / Xiong, Z. et al. | 2010
- 46
-
S-Mo-3.2: ON THE SUM RATE OF VECTOR GAUSSIAN MULTITERMINAL SOURCE CODINGWang, J. / Chen, J. et al. | 2010
- 51
-
S-Mo-3.3: DISTRIBUTED SOURCE CODING OF CORRELATED MEMORYLESS GAUSSIAN OBSERVATIONSOohama, Y. et al. | 2010
- 56
-
S-Mo-3.4: RATE REGION OF THE GAUSSIAN SCALAR-HELP-VECTOR SOURCE-CODING PROBLEMRahman, M.S. / Wagner, A. et al. | 2010
- 61
-
S-Mo-4.1: INTERACTION STRICTLY IMPROVES THE WYNER-ZIV RATE-DISTORTION FUNCTIONMa, N. / Ishwar, P. et al. | 2010
- 66
-
S-Mo-4.2: ON THE RATE DISTORTION FUNCTION OF BERNOULLI GAUSSIAN SEQUENCESChang, C. et al. | 2010
- 71
-
S-Mo-4.3: ON THE PHYSICS OF RATE-DISTORTION THEORYMerhav, N. et al. | 2010
- 76
-
S-Mo-4.4: IMPROVED UPPER BOUNDS TO THE CAUSAL QUADRATIC RATE-DISTORTION FUNCTION FOR GAUSSIAN STATIONARY SOURCESDerpich, M. / Ostergaard, J. et al. | 2010
- 76
-
Improved upper bounds to the causal quadratic rate-distortion function for Gaussian stationary sourcesDerpich, Milan S. / Ostergaard, Jan et al. | 2010
- 81
-
S-Tu-1.1: ON OPTIMAL CAUSAL CODING OF PARTIALLY OBSERVED MARKOV SOURCES UNDER CLASSICAL AND NON-CLASSICAL INFORMATION STRUCTURESYuksel, S. et al. | 2010
- 86
-
S-Tu-1.2: STRUCTURE THEOREM FOR REAL-TIME VARIABLE-RATE LOSSY SOURCE ENCODERS AND MEMORY-LIMITED DECODERS WITH SIDE INFORMATIONKaspi, Y. / Merhav, N. et al. | 2010
- 91
-
S-Tu-1.3: SOURCE CODING WITH SIDE INFORMATION USING LIST DECODINGAli, M. / Kuijper, M. et al. | 2010
- 91
-
Source coding with side information using list decodingAli, Mortuza / Kuijper, Margreta et al. | 2010
- 96
-
S-Tu-1.4: SOURCE CODING WITH FEEDFORWARD USING THE POSTERIOR MATCHING SCHEMEEbeid, H.-J. / Coleman, T. et al. | 2010
- 96
-
Source coding with feedforward using the posterior matching schemeEbeid, Hani-James / Coleman, Todd P. et al. | 2010
- 101
-
S-Tu-2.1: ASYMPTOTIC OPTIMALITY OF ANTIDICTIONARY CODESOta, T. / Morita, H. et al. | 2010
- 106
-
S-Tu-2.2: FRACTAL COMPRESSION RATE CURVES IN LOSSLESS COMPRESSION OF BALANCED TREESOh, S.-Y. / Kieffer, J. et al. | 2010
- 111
-
S-Tu-2.3: LOCAL COORDINATES OF A TRELLIS SOURCE CODEKieffer, J. / Marcos, J. et al. | 2010
- 116
-
S-Tu-2.4: CASES WHERE FINDING THE MINIMUM ENTROPY COLORING OF A CHARACTERISTIC GRAPH IS A POLYNOMIAL TIME PROBLEMFeizi, S. / Medard, M. et al. | 2010
- 116
-
Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problemFeizi, Soheil / Medard, Muriel et al. | 2010
- 121
-
S-Tu-3.1: ON THE ERROR EXPONENT TO REDUNDANCY RATIO OF INTERACTIVE ENCODING AND DECODINGMeng, J. / Yang, E.-H. et al. | 2010
- 121
-
On the error exponent to redundancy ratio of interactive encoding and decodingMeng, Jin / Yang, En-Hui et al. | 2010
- 126
-
S-Tu-3.2: ON THE ACHIEVABLE REDUNDANCY RATE OF FIXED LENGTH SOURCE CODE FOR GENERAL SOURCESArimura, M. / Iwata, K.-I. et al. | 2010
- 131
-
S-Tu-3.3: ON THE OVERFLOW PROBABILITY OF LOSSLESS CODES WITH SIDE INFORMATIONNomura, R. / Matsushima, T. et al. | 2010
- 131
-
On the overflow probability of lossless codes with side informationNomura, Ryo / Matsushima, Toshiyasu et al. | 2010
- 136
-
S-Tu-4.1: A TIGHT BOUND ON THE PERFORMANCE OF A MINIMAL DELAY JOINT SOURCE-CHANNEL CODING SCHEMEKleiner, M. / Rimoldi, B. et al. | 2010
- 141
-
S-Tu-4.2: ON OPTIMALITY OF A HYBRID DIGITAL/ANALOG SCHEME FOR WYNER-ZIV CODING OVER BROADCAST CHANNELSGao, Y. / Tuncel, E. et al. | 2010
- 146
-
S-Tu-4.3: THE ACHIEVABLE DISTORTION REGION OF BIVARIATE GAUSSIAN SOURCE ON GAUSSIAN BROADCAST CHANNELTian, C. / Diggavi, S. / Shamai, S. et al. | 2010
- 151
-
S-Tu-4.4: DISTRIBUTED SIGNAL CANCELATION INSPIRED BY WITSENHAUSEN'S COUNTEREXAMPLEGrover, P. / Sahai, A. et al. | 2010
- 156
-
S-Tu-4.5: DISTORTION EXPONENTS OF TWO-WAY RELAYING COOPERATIVE NETWORKSWang, J. / Liang, J. et al. | 2010
- 161
-
S-We-2.1: EXACT-REPAIR MDS CODES FOR DISTRIBUTED STORAGE USING INTERFERENCE ALIGNMENTSuh, C. / Ramchandran, K. et al. | 2010
- 166
-
S-We-2.2: INTERFERENCE NEUTRALIZATION IN DISTRIBUTED LOSSY SOURCE CODINGMaddah-Ali, M.A. / Tse, D. et al. | 2010
- 171
-
S-We-2.3: HAMMING CODING FOR MULTIPLE SOURCESMa, R. / Cheng, S. et al. | 2010
- 176
-
S-We-2.4: TWO-WAY SOURCE CODING THROUGH A RELAYSu, H.-I. / El Gamal, A. et al. | 2010
- 181
-
S-Th-1.1: OPTIMAL MULTIRESOLUTION QUANTIZATION FOR BROADCAST CHANNELS WITH RANDOM INDEX ASSIGNMENTTeng, F. / Yang, E.-H. / Yu, X. et al. | 2010
- 186
-
Universal Slepian-Wolf Source Codes Using Low-density Parity-check MatricesMatsuta, Tetsunao / Uyematsu, Tomohiko / Matsumoto, Ryutaroh et al. | 2010
- 186
-
S-Th-1.2: UNIVERSAL SLEPIAN-WOLF SOURCE CODES USING LOW-DENSITY PARITY-CHECK MATRICESMatsuta, T. / Uyematsu, T. / Matsumoto, R. et al. | 2010
- 191
-
S-Th-1.3: IDENTIFICATION AND LOSSY RECONSTRUCTION IN NOISY DATABASESTuncel, E. / Gunduz, D. et al. | 2010
- 196
-
S-Th-1.4: ON THE MEMORY REQUIRED TO COMPUTE FUNCTIONS OF STREAMING DATAViswanathan, K. et al. | 2010
- 201
-
S-Th-2.1: THE CAPACITY OF THE UNIFORM NOISE REWRITABLE CHANNEL WITH AVERAGE COSTLastras-Montano, L.A. / Franceschini, M.M. / Mittelholzer, T. et al. | 2010
- 206
-
S-Th-2.2: A FOKKER-PLANCK DIFFERENTIAL EQUATION APPROACH FOR THE ZERO-DISPERSION OPTICAL FIBER CHANNELYousefi, M.I. / Kschischang, F. et al. | 2010
- 206
-
A Fokker-Planck differential equation approach for the zero-dispersion optical fiber channelYousefi, Mansoor I. / Kschischang, Frank R. et al. | 2010
- 211
-
S-Th-2.3: ONE-SHOT CAPACITY OF DISCRETE CHANNELSCosta, R.A. / Langberg, M. / Barros, J. et al. | 2010
- 216
-
S-Th-3.1: ON REVERSIBLE MARKOV CHAINS AND MAXIMIZATION OF DIRECTED INFORMATIONGorantla, S.K. / Coleman, T. et al. | 2010
- 221
-
S-Th-3.2: MINIMUM ENERGY TO SEND K BITS WITH AND WITHOUT FEEDBACKPolyanskiy, Y. / Poor, H.V. / Verdu, S. et al. | 2010
- 226
-
S-Th-3.3: ON THE ACHIEVABLE RATE OF THE ADDITIVE GAUSSIAN NOISE CHANNEL WITH NOISY FEEDBACKHam, J. / Love, D. et al. | 2010
- 231
-
Variable-length coding with feedback in the non-asymptotic regimePolyanskiy, Yury / Poor, H.Vincent / Verdu, Sergio et al. | 2010
- 231
-
S-Th-3.4: VARIABLE-LENGTH CODING WITH FEEDBACK IN THE NON-ASYMPTOTIC REGIMEPolyanskiy, Y. / Poor, H.V. / Verdu, S. et al. | 2010
- 236
-
S-Th-4.1: OPPORTUNISTIC CAPACITY AND ERROR EXPONENT REGIONS FOR COMPOUND CHANNEL WITH FEEDBACKMahajan, A. / Tatikonda, S. et al. | 2010
- 241
-
S-Th-4.2: BIT-WISE UNEQUAL ERROR PROTECTION FOR VARIABLE LENGTH BLOCK-CODES WITH FEEDBACKGorantla, S.K. / Nakiboglu, B. / Coleman, T. / Zheng, L. et al. | 2010
- 246
-
S-Th-4.3: AN UPPER BOUND FOR THE BLOCK CODING ERROR EXPONENT WITH DELAYED FEEDBACKPalaiyanur, H. / Sahai, A. et al. | 2010
- 251
-
S-Th-4.4: SPHERE-PACKING BOUND BLOCK-CODES WITH FEEDBACK AND FINITE MEMORYComo, G. / Nakiboglu, B. et al. | 2010
- 256
-
S-Th-4.5: ON THE AWGN CHANNEL WITH NOISY FEEDBACK AND PEAK ENERGY CONSTRAINTXiang, Y. / Kim, Y.-H. et al. | 2010
- 260
-
S-Fr-1.1: EXACT RANDOM CODING EXPONENTS FOR ERASURE DECODINGSomekh-Baruch, A. / Merhav, N. et al. | 2010
- 265
-
S-Fr-1.2: MODERATE DEVIATION ANALYSIS OF CHANNEL CODING: DISCRETE MEMORYLESS CASEAltug, Y. / Wagner, A. et al. | 2010
- 270
-
Achievable Error Exponent of Channel Coding in Random Access CommunicationZheng, Wang / Luo, Jie et al. | 2010
- 270
-
S-Fr-1.3: ACHIEVABLE ERROR EXPONENT OF CHANNEL CODING IN RANDOM ACCESS COMMUNICATIONWang, Z. / Luo, J. et al. | 2010
- 275
-
S-Fr-1.4: LEAST SQUARES SUPERPOSITION CODES OF MODERATE DICTIONARY SIZE, RELIABLE AT RATES UP TO CAPACITYBarron, A. / Joseph, A. et al. | 2010
- 280
-
S-Fr-2.1: ASYNCHRONOUS CAPACITY PER UNIT COSTChandar, V. / Tchamkerten, A. / Tse, D. et al. | 2010
- 285
-
S-Fr-2.2: CODING AGAINST DELAYED ADVERSARIESDey, B.K. / Jaggi, S. / Langberg, M. / Sarwate, A. et al. | 2010
- 290
-
S-Fr-2.3: ON THE DETERMINISTIC CODE CAPACITY REGION OF AN ARBITRARILY VARYING MULTIPLE-ACCESS CHANNEL UNDER LIST DECODINGNitinawarat, S. et al. | 2010
- 295
-
S-Fr-2.4: THE ARBITRARILY VARYING CHANNEL WHEN THE JAMMER KNOWS THE CHANNEL INPUTCai, N. / Chan, T. / Grant, A. et al. | 2010
- 300
-
S-Fr-3.1: MUTUAL INFORMATION OF IID COMPLEX GAUSSIAN SIGNALS ON BLOCK RAYLEIGH-FADED CHANNELSRusek, F. / Lozano, A. / Jindal, N. et al. | 2010
- 305
-
S-Fr-3.2: AEP OF OUTPUT WHEN RATE IS ABOVE CAPACITY: THE GAUSSIAN CASEWu, X. / Xie, L.-L. et al. | 2010
- 310
-
S-Fr-3.3: GAUSSIAN CAUSAL DIRTY PAPER CAPACITY IS AT MOST $\LOG\LEFT(1+\FRAC{\SNR}{E}\RIGHT)$Kesal, M. / Erez, U. et al. | 2010
- 315
-
S-Fr-3.4: TOWARD FAST RELIABLE COMMUNICATION AT RATES NEAR CAPACITY WITH GAUSSIAN NOISEBarron, A. / Joseph, A. et al. | 2010
- 320
-
S-Fr-4.1: THE SIMO PRE-LOG CAN BE LARGER THAN THE SISO PRE-LOGMorgenshtern, V.I. / Durisi, G. / Bolcskei, H. et al. | 2010
- 325
-
S-Fr-4.2: ERROR RATES OF CAPACITY-ACHIEVING CODES ARE CONVEXLoyka, S. / Gagnon, F. / Kostina, V. et al. | 2010
- 330
-
M-Mo-1.1: ON THE CAPACITY REGION OF THE POISSON INTERFERENCE CHANNELSLai, L. / Liang, Y. / Shamai, S. et al. | 2010
- 335
-
M-Mo-1.2: SUM CAPACITY OF GENERAL DETERMINISTIC INTERFERENCE CHANNEL WITH CHANNEL OUTPUT FEEDBACKSahai, A. / Aggarwal, V. / Yuksel, M. / Sabharwal, A. et al. | 2010
- 340
-
M-Mo-1.3: INTERFERENCE DECODING FOR DETERMINISTIC CHANNELSBandemer, B. / El Gamal, A. et al. | 2010
- 345
-
M-Mo-1.4: COMMUNICATING CORRELATED SOURCES OVER INTERFERENCE CHANNELS: THE LOSSY CASELiu, W. / Chen, B. et al. | 2010
- 350
-
M-Mo-2.1: ON THE CAPACITY REGION OF FADING Z-INTERFERENCE CHANNELS WITHOUT CSITZhu, Y. / Guo, D. et al. | 2010
- 350
-
On the Capacity Region of Fading Z-Interference Channels without CSITZhu, Yan / Guo, Dongning et al. | 2010
- 355
-
M-Mo-2.2: LAYERED INTERFERENCE ALIGNMENT: ACHIEVING THE TOTAL DOF OF MIMO X-CHANNELSMahboubi, S.H. / Motahari, A.S. / Khandani, A.K. et al. | 2010
- 360
-
M-Mo-2.3: INTERFERENCE ALIGNMENT FOR THE $K$ USER MIMO INTERFERENCE CHANNELGhasemi, A. / Motahari, A.S. / Khandani, A.K. et al. | 2010
- 365
-
M-Mo-2.4: COORDINATION AND BARGAINING OVER THE GAUSSIAN INTERFERENCE CHANNELLiu, X. / Erkip, E. et al. | 2010
- 370
-
M-Mo-3.1: ZERO-FORCING FOR THE SYMMETRIC INTERFERENCE CHANNEL WITH CONFERENCING ENCODERSBagheri, H. / Motahari, A.S. / Khandani, A.K. et al. | 2010
- 375
-
M-Mo-3.2: INTERFERENCE CHANNELS WITH HALF DUPLEX SOURCE COOPERATIONWu, R. / Prabhakaran, V. / Viswanath, P. et al. | 2010
- 380
-
M-Mo-3.3: INTERFERENCE MITIGATION THROUGH LIMITED TRANSMITTER COOPERATIONWang, I.-H. / Tse, D. et al. | 2010
- 385
-
M-Mo-3.4: DEGREES OF FREEDOM OF THE K-USER INTERFERENCE CHANNEL WITH TRANSMITTER COOPERATIONAnnapureddy, V.S. / El Gamal, A. / Veeravalli, V. et al. | 2010
- 390
-
M-Mo-4.1: RELAY-AIDED INTERFERENCE ALIGNMENT: FEASIBILITY CONDITIONS AND ALGORITHMNing, H. / Ling, C. / Leung, K.K. et al. | 2010
- 395
-
M-Mo-4.2: INTERFERENCE CHANNEL WITH A HALF-DUPLEX OUT-OF-BAND RELAYSahin, O. / Simeone, O. / Erkip, E. et al. | 2010
- 400
-
M-Mo-4.3: THE ERGODIC FADING INTERFERENCE CHANNEL WITH AN ON-AND-OFF RELAYTian, Y. / Yener, A. et al. | 2010
- 405
-
M-Mo-4.4: RELAY-AIDED INTERFERENCE ALIGNMENT FOR THE QUASI-STATIC INTERFERENCE CHANNELNourani, B. / Motahari, A.S. / Khandani, A.K. et al. | 2010
- 410
-
M-Tu-1.1: ASYMPTOTIC SUM-CAPACITY OF RANDOM GAUSSIAN INTERFERENCE NETWORKS USING INTERFERENCE ALIGNMENTAldridge, M. / Johnson, O. / Piechocki, R. et al. | 2010
- 415
-
M-Tu-1.2: NORMALIZED SUM-CAPACITY OF INTERFERENCE NETWORKS WITH PARTIAL INFORMATIONAggarwal, V. / Avestimehr, A.S. / Sabharwal, A. et al. | 2010
- 420
-
M-Tu-1.3: ON THE ACHIEVABLE RATES IN DECENTRALIZED NETWORKS WITH RANDOMIZED MASKINGMoshksar, K. / Khandani, A.K. et al. | 2010
- 425
-
M-Tu-1.4: CAPACITY BOUNDS ON MULTI-PAIR TWO-WAY COMMUNICATION WITH A BASE-STATION AIDED BY A RELAYKim, S.J. / Smida, B. / Devroye, N. et al. | 2010
- 430
-
M-Tu-2.1: LINEAR SUM CAPACITY FOR GAUSSIAN MULTIPLE ACCESS CHANNEL WITH FEEDBACKArdestanizadeh, E. / Wigger, M. / Kim, Y.-H. / Javidi, T. et al. | 2010
- 435
-
M-Tu-2.2: ON ACHIEVABLE RATE REGIONS FOR HALF-DUPLEX CAUSAL COGNITIVE RADIO CHANNELSChatterjee, D. / Wong, T. / Oyman, O. et al. | 2010
- 440
-
M-Tu-2.3: THE DEGREES OF FREEDOM REGION OF THE MIMO COGNITIVE INTERFERENCE CHANNEL WITH NO CSITVaze, C. / Varanasi, M. et al. | 2010
- 445
-
M-Tu-2.4: ON THE ACHIEVABLE RATE REGIONS FOR A CLASS OF COGNITIVE RADIO CHANNELS: INTERFERENCE CHANNEL WITH DEGRADED MESSAGE SETS WITH UNIDIRECTIONAL DESTINATION COOPERATIONChu, H.-Y. et al. | 2010
- 450
-
M-Tu-3.1: AN ACHIEVABLE REGION FOR THE DISCRETE MEMORYLESS BROADCAST CHANNEL WITH FEEDBACKShayevitz, O. / Wigger, M. et al. | 2010
- 455
-
M-Tu-3.2: ACHIEVABLE RATES FOR THE BROADCAST CHANNEL WITH FEEDBACKVenkataramanan, R. / Pradhan, S.S. et al. | 2010
- 460
-
M-Tu-3.3: THE TWO-USER DETERMINISTIC INTERFERENCE CHANNEL WITH RATE-LIMITED FEEDBACKVahid, A. / Avestimehr, A.S. et al. | 2010
- 465
-
M-Tu-3.4: THE DISCRETE MEMORYLESS INTERFERENCE CHANNEL WITH ONE-SIDED GENERALIZED FEEDBACKBross, S. / Steinberg, Y. / Tinguely, S. et al. | 2010
- 470
-
M-Tu-4.1: ON THE CAPACITY REGION OF A MULTIPLE ACCESS CHANNEL WITH COMMON MESSAGESGunduz, D. / Simeone, O. et al. | 2010
- 475
-
Coset codes for multiple access channels with common information based on LDPC codesYagi, Hideki / Poor, H.Vincent et al. | 2010
- 475
-
M-Tu-4.2: COSET CODES FOR MULTIPLE ACCESS CHANNELS WITH COMMON INFORMATION BASED ON LDPC CODESYagi, H. / Poor, H.V. et al. | 2010
- 480
-
M-Tu-4.3: THE MULTIPLE ACCESS CHANNEL WITH TWO INDEPENDENT STATES EACH KNOWN CAUSALLY TO ONE ENCODERLapidoth, A. / Steinberg, Y. et al. | 2010
- 485
-
M-Tu-4.4: THE CAPACITY REGION OF FADING MULTIPLE ACCESS CHANNELS WITH COOPERATIVE ENCODERS AND PARTIAL CSITHaghi, A. / Khosravi-Farsani, R. / Aref, M.R. / Marvasti, F. et al. | 2010
- 490
-
M-Tu-4.5: SCHEDULING JOBS WITH HARD DEADLINES OVER MULTIPLE ACCESS AND DEGRADED BROADCAST CHANNELSVasudevan, D. / Subramanian, V. / Leith, D. et al. | 2010
- 495
-
M-We-2.1: OPTIMALITY AND APPROXIMATE OPTIMALITY OF SOURCE-CHANNEL SEPARATION IN NETWORKSTian, C. / Chen, J. / Diggavi, S. / Shamai, S. et al. | 2010
- 500
-
M-We-2.2: ON THE SEPARATION OF LOSSY SOURCE-NETWORK CODING AND CHANNEL CODING IN WIRELINE NETWORKSJalali, S. / Effros, M. et al. | 2010
- 500
-
On the separation of lossy source-network coding and channel coding in wireline networksJalali, Shirin / Effros, Michelle et al. | 2010
- 505
-
M-We-2.3: ON THE OPTIMALITY OF MULTI-HOP COMMUNICATION IN LARGE WIRELESS NETWORKSNiesen, U. / Gupta, P. / Tse, D. et al. | 2010
- 510
-
M-We-2.4: MULTI-HOP ROUTING IS ORDER-OPTIMAL IN UNDERWATER EXTENDED NETWORKSShin, W.-Y. / Lucani, D.E. / Medard, M. / Stojanovic, M. / Tarokh, V. et al. | 2010
- 515
-
M-We-2.5: CAPACITY OF A CLASS OF TREE NETWORKSLee, S.-H. / Chung, S.-Y. et al. | 2010
- 520
-
M-Th-1.1: TYPICALITY GRAPHS AND THEIR PROPERTIESNazari, A. / Krithivasan, D. / Pradhan, S. / Anastasopoulos, A. / Venkataramanan, R. et al. | 2010
- 525
-
M-Th-1.2: ON DUALITY RELATIONS FOR THE DISCRETE MEMORYLESS MULTIPLE ACCESS AND BROADCAST CHANNELBuhler, J. / Wunder, G. et al. | 2010
- 530
-
M-Th-1.3: OPERATIONAL DUALITY BETWEEN GELFAND-PINSKER AND WYNER-ZIV CODINGGupta, A. / Verdu, S. et al. | 2010
- 535
-
M-Th-1.4: ON MMSE PROPERTIES AND I-MMSE IMPLICATIONS IN PARALLEL MIMO GAUSSIAN CHANNELSBustin, R. / Payar o, M. / Palomar, D.P. / Shamai, S. et al. | 2010
- 535
-
On MMSE properties and I-MMSE implications in parallel MIMO Gaussian channelsBustin, Ronit / Payaro, Miquel / Palomar, Daniel P. / Shamai, Shlomo et al. | 2010
- 540
-
M-Th-2.1: ON AN OUTER BOUND AND AN INNER BOUND FOR THE GENERAL BROADCAST CHANNELGohari, A. / El Gamal, A. / Anantharam, V. et al. | 2010
- 545
-
M-Th-2.2: ON BROADCAST CHANNELS WITH BINARY INPUTS AND SYMMETRIC OUTPUTSGeng, Y. / Nair, C. / Shamai, S. / Wang, Z. et al. | 2010
- 550
-
M-Th-2.3: AN INFORMATION INEQUALITY AND EVALUATION OF MARTON'S INNER BOUND FOR BINARY INPUT BROADCAST CHANNELSNair, C. / Wang, Z. / Geng, Y. et al. | 2010
- 555
-
M-Th-2.4: SECURE-BROADCAST CODES OVER LINEAR-DETERMINISTIC CHANNELSKhisti, A. / Silva, D. / Kschischang, F. et al. | 2010
- 560
-
M-Th-3.1: THE CAPACITY REGION OF A PRODUCT OF TWO UNMATCHED GAUSSIAN BROADCAST CHANNELS WITH THREE PARTICULAR MESSAGES AND A COMMON MESSAGEGohary, R. / Davidson, T. et al. | 2010
- 565
-
M-Th-3.2: ON GAUSSIAN MIMO BROADCAST CHANNELS WITH COMMON AND PRIVATE MESSAGESEkrem, E. / Ulukus, S. et al. | 2010
- 570
-
M-Th-3.3: TOWARD COMPUTING THE CAPACITY REGION OF DEGRADED BROADCAST CHANNELYasui, K. / Matsushima, T. et al. | 2010
- 575
-
M-Th-3.4: CONSTRUCTION OF BROADCAST CHANNEL CODE BASED ON HASH PROPERTYMuramatsu, J. / Miyake, S. et al. | 2010
- 580
-
M-Th-4.1: CAPACITY BOUNDS FOR NETWORKS OF BROADCAST CHANNELSEffros, M. et al. | 2010
- 585
-
M-Th-4.2: PARALLEL RELAY BROADCAST CHANNELSChen, L. et al. | 2010
- 590
-
M-Th-4.3: CAPACITY OF A CLASS OF BROADCAST RELAY CHANNELSBehboodi, A. / Piantanida, P. et al. | 2010
- 595
-
M-Th-4.4: THE CAPACITY REGION OF A CLASS OF BROADCAST CHANNELS WITH A SEQUENCE OF LESS NOISY RECEIVERSWang, Z. / Nair, C. et al. | 2010
- 599
-
M-Th-4.5: AN OUTER BOUND ON THE CAPACITY REGION OF BROADCAST-RELAY-CHANNELSalehkalaibar, S. / Ghabeli, L. / Aref, M.R. et al. | 2010
- 604
-
M-Fr-1.1: MULTI-SOURCE NOISY NETWORK CODINGLim, S.H. / Kim, Y.-H. / El Gamal, A. / Chung, S.-Y. et al. | 2010
- 609
-
M-Fr-1.2: OUTAGE CAPACITY OF THE BROADCAST CHANNEL IN THE LOW POWER REGIMEUppal, M. / Host-Madsen, A. / Xiong, Z. et al. | 2010
- 614
-
M-Fr-1.3: ON THE WEIGHTED SUM-RATE CAPACITY OF BROADCAST CHANNELS THAT GENERATE INTERFERENCEShang, X. / Poor, H.V. et al. | 2010
- 619
-
M-Fr-1.4: INTERFERENCE ALIGNMENT UNDER LIMITED FEEDBACK FOR MIMO INTERFERENCE CHANNELSKrishnamachari, R.T. / Varanasi, M.K. et al. | 2010
- 624
-
M-Fr-2.1: ON THE CAPACITY OF COMPOUND STATE-DEPENDENT CHANNELS WITH STATES KNOWN AT THE TRANSMITTERPiantanida, P. / Shamai, S. et al. | 2010
- 629
-
M-Fr-2.2: SOURCE AND CHANNEL CODING WITH ACTION-DEPENDENT PARTIALLY KNOWN TWO-SIDED STATE INFORMATIONKittichokechai, K. / Oechtering, T.J. / Skoglund, M. / Thobaben, R. et al. | 2010
- 634
-
M-Fr-2.3: STATE-DEPENDENT RELAY CHANNEL WITH PRIVATE MESSAGES WITH PARTIAL CAUSAL AND NON-CAUSAL CHANNEL STATE INFORMATIONAkhbari, B. / Mirmohseni, M. / Aref, M.R. et al. | 2010
- 639
-
M-Fr-2.4: BOUNDS ON THE CAPACITY OF THE RELAY CHANNEL WITH NONCAUSAL STATE INFORMATION AT SOURCEZaidi, A. / Shamai, S. / Piantanida, P. / Vandendorpe, L. et al. | 2010
- 644
-
M-Fr-3.1: DIAMOND CHANNEL WITH PARTIALLY SEPARATED RELAYSTandon, R. / Ulukus, S. et al. | 2010
- 644
-
Diamond channel with partially separated relaysTandon, Ravi / Ulukus, Sennur et al. | 2010
- 649
-
M-Fr-3.2: ON THE CAPACITY OF THE HALF-DUPLEX DIAMOND CHANNELBagheri, H. / Motahari, A.S. / Khandani, A.K. et al. | 2010
- 654
-
M-Fr-3.3: THE BINARY-SYMMETRIC PARALLEL-RELAY NETWORKOng, L. / Johnson, S.J. / Kellett, C.M. et al. | 2010
- 659
-
M-Fr-3.4: ON ACHIEVABLE RATES FOR RELAY NETWORKS BASED ON PARTIAL DECODE-AND-FORWARDGhabeli, L. / Aref, M.R. et al. | 2010
- 664
-
M-Fr-4.1: CAPACITY THEOREMS FOR THE AWGN MULTI-WAY RELAY CHANNELOng, L. / Kellett, C.M. / Johnson, S.J. et al. | 2010
- 669
-
M-Fr-4.2: APPROXIMATELY ACHIEVING GAUSSIAN RELAY NETWORK CAPACITY WITH LATTICE CODESOzgur, A. / Diggavi, S. et al. | 2010
- 674
-
M-Fr-4.3: MULTIPLEXING GAIN OF AMPLIFY-FORWARD RELAYING IN WIRELESS MULTI-ANTENNA RELAY NETWORKSGharan, S.O. / Khandani, A.K. et al. | 2010
- 679
-
M-Fr-4.4: ON THE NON-COHERENT WIDEBAND MULTIPATH FADING RELAY CHANNELFawaz, N. / Medard, M. et al. | 2010
- 684
-
C-Mo-1.1: THRESHOLD SATURATION VIA SPATIAL COUPLING: WHY CONVOLUTIONAL LDPC ENSEMBLES PERFORM SO WELL OVER THE BECKudekar, S. / Richardson, T. / Urbanke, R. et al. | 2010
- 689
-
C-Mo-1.2: ON UNIVERSAL LDPC CODE ENSEMBLESSason, I. / Shuval, B. et al. | 2010
- 694
-
C-Mo-1.3: EXIT CHART APPROXIMATIONS USING THE ROLE MODEL APPROACHSayir, J. et al. | 2010
- 694
-
EXIT Chart Approximations using the Role Model ApproachSayir, Jossy et al. | 2010
- 699
-
C-Mo-1.4: CHANNELS WITH BOTH RANDOM ERRORS AND BURST ERASURES: CAPACITIES, LDPC CODE THRESHOLDS, AND CODE PERFORMANCESLi, K. / Kavcic, A. / Venkataramani, R. / Erden, F. et al. | 2010
- 704
-
C-Mo-2.1: CONNECTING THE BETHE ENTROPY AND THE EDGE ZETA FUNCTION OF A CYCLE CODEVontobel, P. et al. | 2010
- 709
-
On the Thresholds of Generalized LDPC Convolutional Codes Based on ProtographsLentmaier, Michael / Fettweis, Gerhard P. et al. | 2010
- 709
-
C-Mo-2.2: ON THE THRESHOLDS OF GENERALIZED LDPC CONVOLUTIONAL CODES BASED ON PROTOGRAPHSLentmaier, M. / Fettweis, G. et al. | 2010
- 714
-
C-Mo-2.3: FINITE-LENGTH SCALING OF NON-BINARY (C,D) LDPC CODES FOR THE BECAndriyanova, I. / Kasai, K. et al. | 2010
- 719
-
C-Mo-2.4: ON THE TYPICAL MINIMUM DISTANCE OF PROTOGRAPH-BASED GENERALIZED LDPC CODESAbu-Surra, S. / Divsalar, D. / Ryan, W. et al. | 2010
- 724
-
Lowering the error floor of LDPC codes using cyclic liftingsAsvadi, Reza / Banihashemi, Amir H. / Ahmadian-Attari, Mahmoud et al. | 2010
- 724
-
C-Mo-3.1: LOWERING THE ERROR FLOOR OF LDPC CODES USING CYCLIC LIFTINGSAsvadi, R. / Banihashemi, A.H. / Ahmadian-Attari, M. et al. | 2010
- 729
-
C-Mo-3.2: ERROR FLOORS OF NON-BINARY LDPC CODESNozaki, T. / Kasai, K. / Sakaniwa, K. et al. | 2010
- 734
-
C-Mo-3.3: ERROR FLOOR ANALYSIS IN LDGM CODESLiu, K. / Garcia-Frias, J. et al. | 2010
- 739
-
C-Mo-3.4: EXHAUSTIVE SEARCH FOR SMALL FULLY ABSORBING SETS AND THE CORRESPONDING LOW ERROR-FLOOR DECODERKyung, G.B. / Wang, C.-C. et al. | 2010
- 744
-
C-Mo-4.1: LP DECODING OF REGULAR LDPC CODES IN MEMORYLESS CHANNELSHalabi, N. / Even, G. et al. | 2010
- 749
-
C-Mo-4.2: THE LIMITS OF ERROR CORRECTION WITH LP DECODINGWang, M. / Xu, W. / Tang, A. et al. | 2010
- 754
-
C-Mo-4.3: ON THE JOINT DECODING OF LDPC CODES AND FINITE-STATE CHANNELS VIA LINEAR PROGRAMMINGKim, B.-H. / Pfister, H. et al. | 2010
- 759
-
C-Mo-4.4: ON THE PSEUDOCODEWORD REDUNDANCYZumbragel, J. / Flanagan, M.F. / Skachek, V. et al. | 2010
- 764
-
C-Mo-4.5: ON MINIMAL PSEUDO-CODEWORDSSmarandache, R. et al. | 2010
- 769
-
C-Tu-1.1: MULTILEVEL DECODERS SURPASSING BELIEF PROPAGATION ON THE BINARY SYMMETRIC CHANNELPlanjery, S.K. / Declercq, D. / Chilappagari, S.K. / Vasic, B. et al. | 2010
- 774
-
C-Tu-1.2: IMPROVED ADAPTIVE BELIEF PROPAGATION DECODING USING EDGE-LOCAL COMPLEMENTATIONKnudsen, J.G. / Riera, C. / Danielsen, L.E. / Parker, M.G. / Rosnes, E. et al. | 2010
- 779
-
C-Tu-1.3: MULTITREE DECODING AND MULTITREE-AIDED LDPC DECODINGOstojic, M. / Loeliger, H.-A. et al. | 2010
- 784
-
C-Tu-1.4: LDPC CODES WITH FIXED INITIALIZATION DECODING OVER BINARY SYMMETRIC CHANNELHagiwara, M. / Fossorier, M. / Imai, H. et al. | 2010
- 789
-
C-Tu-2.1: DECODING OF LDPC CONVOLUTIONAL CODES WITH RATIONAL PARITY-CHECK MATRICES FROM A NEW GRAPHICAL PERSPECTIVEWeng, J.-J. / Lai, C.-C. / Wang, C.-H. et al. | 2010
- 794
-
C-Tu-2.2: A LOW-COMPLEXITY JOINT DETECTION-DECODING ALGORITHM FOR NONBINARY LDPC-CODED MODULATION SYSTEMSWang, X. / Bai, B. / Ma, X. et al. | 2010
- 799
-
C-Tu-2.3: TREE-STRUCTURE EXPECTATION PROPAGATION FOR DECODING LDPC CODES OVER BINARY ERASURE CHANNELSOlmos, P.M. / Murillo-Fuentes, J.J. / Perez-Cruz, F. et al. | 2010
- 804
-
C-Tu-2.4: LINEAR ESTIMATE-BASED LOOK-AHEAD PATH METRIC FOR EFFICIENT SOFT-INPUT SOFT-OUTPUT TREE DETECTIONChoi, J.W. / Shim, B. / Singer, A. et al. | 2010
- 809
-
C-Tu-3.1: ON DISTANCE PROPERTIES OF QUASI-CYCLIC PROTOGRAPH-BASED LDPC CODESButler, B.K. / Siegel, P. et al. | 2010
- 814
-
C-Tu-3.2: CIRCULANT ARRAYS: RANK ANALYSIS AND CONSTRUCTION OF QUASI-CYCLIC LDPC CODESZhang, L. / Lin, S. / Abdel-Ghaffar, K. / Zhou, B. et al. | 2010
- 819
-
C-Tu-3.3: NEW LOW-DENSITY PARITY-CHECK CODES WITH LARGE GIRTH BASED ON HYPERGRAPHSBocharova, I.E. / Hug, F. / Johannesson, R. / Kudryashov, B.D. / Satyukov, R.V. et al. | 2010
- 824
-
C-Tu-3.4: NEW FAMILIES OF LDPC BLOCK CODES FORMED BY TERMINATING IRREGULAR PROTOGRAPH-BASED LDPC CONVOLUTIONAL CODESMitchell, D. / Lentmaier, M. / Costello, D. et al. | 2010
- 829
-
C-Tu-4.1: ALGEBRAIC CONSTRUCTIONS OF GRAPH-BASED NESTED CODES FROM PROTOGRAPHSKelley, C. / Kliewer, J. et al. | 2010
- 834
-
C-Tu-4.2: RECURSIVE CONVOLUTIONAL CODES FOR TIME-INVARIANT LDPC CONVOLUTIONAL CODESRoy, E. / Cardinal, C. / Haccoun, D. et al. | 2010
- 839
-
C-Tu-4.3: TWO-DIMENSIONAL GENERALIZED REED-SOLOMON CODES: A UNIFIED FRAMEWORK FOR QUASI-CYCLIC LDPC CODES CONSTRUCTED BASED ON FINITE FIELDSChen, C. / Bai, B. / Wang, X. et al. | 2010
- 844
-
C-Tu-4.4: RATE-COMPATIBLE NON-BINARY LDPC CODES CONCATENATED WITH MULTIPLICATIVE REPETITION CODESKasai, K. / Declercq, D. / Poulliat, C. / Sakaniwa, K. et al. | 2010
- 849
-
C-Tu-4.5: A NEW CONSTRUCTION OF UEP QC-LDPC CODESWu, C.-J. / Wang, C.-H. / Chao, C.-C. et al. | 2010
- 854
-
C-We-2.1: CODES IN PERMUTATIONS AND ERROR CORRECTION FOR RANK MODULATIONBarg, A. / Mazumdar, A. et al. | 2010
- 854
-
Codes in Permutations and Error Correction for Rank ModulationBarg, Alexander / Mazumdar, Arya et al. | 2010
- 859
-
C-We-2.2: LDPC CODES FOR RANK MODULATION IN FLASH MEMORIESZhang, F. / Pfister, H. / Jiang, A. et al. | 2010
- 864
-
C-We-2.3: PARTIAL RANK MODULATION FOR FLASH MEMORIESWang, Z. / Bruck, J. et al. | 2010
- 869
-
C-We-2.4: CONSTANT-WEIGHT GRAY CODES FOR LOCAL RANK MODULATIONSchwartz, M. et al. | 2010
- 874
-
C-Th-1.1: ON THE SCALING OF POLAR CODES: I. THE BEHAVIOR OF POLARIZED CHANNELSHassani, S.H. / Urbanke, R. et al. | 2010
- 879
-
C-Th-1.2: ON THE SCALING OF POLAR CODES: II. THE BEHAVIOR OF UN-POLARIZED CHANNELSHassani, S.H. / Alishahi, K. / Urbanke, R. et al. | 2010
- 884
-
C-Th-1.3: AN EMPIRICAL SCALING LAW FOR POLAR CODESKorada, S.B. / Montanari, A. / Telatar, E. / Urbanke, R. et al. | 2010
- 889
-
C-Th-1.4: REFINED RATE OF CHANNEL POLARIZATIONTanaka, T. / Mori, R. et al. | 2010
- 894
-
C-Th-2.1: CHANNEL POLARIZATION ON Q-ARY DISCRETE MEMORYLESS CHANNELS BY ARBITRARY KERNELSMori, R. / Tanaka, T. et al. | 2010
- 899
-
C-Th-2.2: SOURCE POLARIZATIONArikan, E. et al. | 2010
- 904
-
C-Th-2.3: LOSSLESS SOURCE CODING WITH POLAR CODESCronie, H.S. / Korada, S.B. et al. | 2010
- 909
-
C-Th-2.4: POLAR CODES FOR Q-ARY SOURCE CODINGKarzand, M. / Telatar, E. et al. | 2010
- 913
-
C-Th-3.1: ACHIEVING THE SECRECY CAPACITY OF WIRETAP CHANNELS USING POLAR CODESMahdavifar, H. / Vardy, A. et al. | 2010
- 913
-
Achieving the secrecy capacity of wiretap channels using Polar codesMahdavifar, Hessam / Vardy, Alexander et al. | 2010
- 918
-
C-Th-3.2: CONCATENATED POLAR CODESBakshi, M. / Jaggi, S. / Effros, M. et al. | 2010
- 923
-
Dirty paper coding using sign-bit shaping and LDPC codesShilpa, G. / Thangaraj, Andrew / Bhashyam, Srikrishna et al. | 2010
- 923
-
C-Th-3.3: DIRTY PAPER CODING USING SIGN-BIT SHAPING AND LDPC CODESGadiraju, S. / Thangaraj, A. / Bhashyam, S. et al. | 2010
- 928
-
C-Th-3.4: A PRACTICAL MESSAGE-WISE UNEQUAL ERROR PROTECTION CODING SCHEMEGong, C. / Yue, G. / Wang, X. et al. | 2010
- 933
-
C-Th-4.1: COOPERATIVE COMMUNICATIONS BASED ON TRELLIS PRUNINGMaiya, S. / Fuja, T. et al. | 2010
- 938
-
C-Th-4.2: BOUNDING OF MAP DECODE AND FORWARD RELAYINGLand, I. / Amat, A.G.i. / Rasmussen, L.K. et al. | 2010
- 943
-
C-Th-4.3: GENERALIZED DISTRIBUTED NETWORK CODING BASED ON NONBINARY LINEAR BLOCK CODES FOR MULTI-USER COOPERATIVE COMMUNICATIONSRebelatto, J.L. / Uchoa-Filho, B.F. / Li, Y. / Vucetic, B. et al. | 2010
- 948
-
C-Th-4.4: BILAYER PROTOGRAPH CODES FOR HALF-DUPLEX RELAY CHANNELSNguyen, T. / Nosratinia, A. / Divsalar, D. et al. | 2010
- 953
-
C-Th-4.5: A RATELESS CODED PROTOCOL FOR HALF-DUPLEX WIRELESS RELAY CHANNELSUppal, M. / Yue, G. / Wang, X. / Xiong, Z. et al. | 2010
- 958
-
C-Fr-1.1: DATA-DEPENDENT WRITE CHANNEL MODEL FOR MAGNETIC RECORDINGIyengar, A. / Siegel, P. / Wolf, J. et al. | 2010
- 963
-
C-Fr-1.2: ON SUFfiCIENT CONDITIONS FOR TESTING OPTIMALITY OF CODEWORDS IN ISI CHANNELSLim, F. / Kavcic, A. / Fossorier, M. et al. | 2010
- 968
-
C-Fr-1.3: ALGORITHMS FOR MEMORIES WITH STUCK CELLSLastras-Montano, L.A. / Jagmohan, A. / Franceschini, M.M. et al. | 2010
- 968
-
Algorithms for memories with stuck cellsLastras-Montano, L.A. / Jagmohan, A. / Franceschini, M.M. et al. | 2010
- 973
-
C-Fr-1.4: REWRITABLE STORAGE CHANNELS WITH LIMITED NUMBER OF REWRITE ITERATIONSMittelholzer, T. / Lastras-Montano, L.A. / Sharma, M. / Franceschini, M.M. et al. | 2010
- 978
-
C-Fr-2.1: CODING FOR HIGH-DENSITY MAGNETIC RECORDINGMazumdar, A. / Barg, A. / Kashyap, N. et al. | 2010
- 983
-
C-Fr-2.2: A NEW ENCODING METHOD FOR INTEGRATED-INTERLEAVED CODESWu, Y. et al. | 2010
- 988
-
Codes for symbol-pair read channelsCassuto, Yuval / Blaum, Mario et al. | 2010
- 988
-
C-Fr-2.3: CODES FOR SYMBOL-PAIR READ CHANNELSCassuto, Y. / Blaum, M. et al. | 2010
- 993
-
C-Fr-2.4: ON THE EQUIVALENCE BETWEEN THE B-CODE CONSTRUCTIONS AND PERFECT ONE-FACTORIZATIONSLi, M. / Shu, J. et al. | 2010
- 997
-
C-Fr-3.1: TIGHT ASYMPTOTIC BOUNDS FOR THE DELETION CHANNEL WITH SMALL DELETION PROBABILITIESKalai, A. / Mitzenmacher, M. / Sudan, M. et al. | 2010
- 1002
-
C-Fr-3.2: ON THE DELETION CHANNEL WITH SMALL DELETION PROBABILITYKanoria, Y. / Montanari, A. et al. | 2010
- 1007
-
C-Fr-3.3: MARKER CODE OPTIMIZATION AND SYMBOL-LEVEL SYNCHRONIZATION FOR INSERTION/DELETION CHANNELSWang, F. / Fertonani, D. / Duman, T.M. et al. | 2010
- 1012
-
On efficient repetition error correcting codesTallini, Luca G. / Elarief, Noha / Bose, Bella et al. | 2010
- 1012
-
C-Fr-3.4: ON EFFICIENT REPETITION ERROR CORRECTING CODESTallini, L. / Elarief, N. / Bose, B. et al. | 2010
- 1017
-
AC-Mo-1.1: AN ALGEBRAIC APPROACH TO PHYSICAL-LAYER NETWORK CODINGFeng, C. / Silva, D. / Kschischang, F. et al. | 2010
- 1022
-
AC-Mo-1.2: INTEGER-FORCING LINEAR RECEIVERSZhan, J. / Nazer, B. / Erez, U. / Gastpar, M. et al. | 2010
- 1027
-
AC-Mo-1.3: COMPLEX LOW DENSITY LATTICE CODESYona, Y. / Feder, M. et al. | 2010
- 1032
-
AC-Mo-1.4: NEAR-OPTIMUM LOW-COMPLEXITY LATTICE QUANTIZATIONKudryashov, B.D. / Yurkov, K. et al. | 2010
- 1037
-
AC-Mo-2.1: THE LIFTING CONSTRUCTION: A GENERAL SOLUTION FOR THE FAT STRUT PROBLEMSloane, N.J.A. / Vaishampayan, V.A. / Costa, S.I.R. et al. | 2010
- 1042
-
AC-Mo-2.2: CLOSEST POINT ALGORITHMS WITH $L_{P}$ NORM FOR ROOT LATTICESTakizawa, K. / Yagi, H. / Kawabata, T. et al. | 2010
- 1047
-
AC-Mo-2.3: PERFECT GRAPH CODES OVER TWO DIMENSIONAL LATTICESMartinez, C. / Camarero, C. / Beivide, R. et al. | 2010
- 1052
-
AC-Mo-3.1: AN IMPROVED 8 TIMES 8 APPROXIMATELY UNIVERSAL CODE WITH THE LARGE NORMALIZED DIVERSITY PRODUCTChen, M.-Y. / Li, H.-C. / Cioffi, J. et al. | 2010
- 1056
-
AC-Mo-3.2: FAST-GROUP-DECODABLE STBCS VIA CODES OVER GF(4)Natarajan, L. / Rajan, B.S. et al. | 2010
- 1061
-
AC-Mo-3.3: ROTATED MODULATIONS FOR OUTAGE PROBABILITY MINIMIZATION: A FADING SPACE APPROACHDuyck, D. / Boutros, J. / Moeneclaey, M. et al. | 2010
- 1066
-
AC-Mo-4.1: A SYSTEMATIC DESIGN OF SPACE-TIME BLOCK CODES WITH REDUCED-COMPLEXITY PARTIAL INTERFERENCE CANCELLATION GROUP DECODINGZhang, W. / Shi, L. / Xia, X.-G. et al. | 2010
- 1071
-
AC-Mo-4.2: ON SPACE-TIME CODE DESIGN WITH A CONDITIONAL PIC GROUP DECODINGXu, T. / Xia, X.-G. et al. | 2010
- 1076
-
AC-Mo-4.3: SET-PARTITION METHODS AND ORTHOGONAL DESIGNSDas, S. et al. | 2010
- 1080
-
AC-Mo-4.4: FAST-DECODABLE MIDO CODES FROM CROSSED PRODUCT ALGEBRASOggier, F. / Vehkalahti, R. / Hollanti, C. et al. | 2010
- 1085
-
AC-Tu-1.1: PERMUTATION DECODING THE BINARY IMAGES OF CERTAIN DOUBLE-PARITY REED-SOLOMON CODESLim, F. / Fossorier, M. / Kavcic, A. et al. | 2010
- 1090
-
AC-Tu-1.2: A FAST GENERALIZED MINIMUM DISTANCE DECODER FOR REED-SOLOMON CODES BASED ON THE EXTENDED EUCLIDEAN ALGORITHMKampf, S. / Bossert, M. et al. | 2010
- 1095
-
AC-Tu-1.3: A RATE-DISTORTION EXPONENT APPROACH TO MULTIPLE DECODING ATTEMPTS FOR REED-SOLOMON CODESNguyen, P. / Pfister, H. / Narayanan, K. et al. | 2010
- 1095
-
A rate-distortion exponent approach to multiple decoding attempts for Reed-Solomon codesNguyen, Phong S. / Pfister, Henry D. / Narayanan, Krishna R. et al. | 2010
- 1100
-
AC-Tu-1.4: OPTIMAL THRESHOLDS FOR GMD DECODING WITH (L+1)/L-EXTENDED BOUNDED DISTANCE DECODERSSenger, C. / Sidorenko, V. / Bossert, M. / Zyablov, V.V. et al. | 2010
- 1105
-
AC-Tu-2.1: MACWILLIAMS IDENTITIES FOR TERMINATED CONVOLUTIONAL CODESForney, G.D. et al. | 2010
- 1110
-
AC-Tu-2.2: HAYMAN-LIKE TECHNIQUES FOR COMPUTING INPUT-OUTPUT WEIGHT DISTRIBUTION OF CONVOLUTIONAL ENCODERSRavazzi, C. / Fagnani, F. et al. | 2010
- 1115
-
AC-Tu-2.3: BOUNDS ON CODES WITH FEW DISTANCESBarg, A. / Musin, O.R. et al. | 2010
- 1120
-
AC-Tu-2.4: HEAVY WEIGHT CODESCohen, G. / Sole, P. / Tchamkerten, A. et al. | 2010
- 1125
-
AC-Tu-3.1: SUBFIELD-SUBCODES OF GENERALIZED TORIC CODESHernando, F. / O Sullivan, M.E. / Popovici, E. / Srivastava, S. et al. | 2010
- 1130
-
AC-Tu-3.2: GOOD CODES FROM GENERALISED ALGEBRAIC GEOMETRY CODESJibril, M. / Tomlinson, M. / Ahmed, M.Z. / Tjhai, C. et al. | 2010
- 1133
-
AC-Tu-3.3: THE PREDICTABLE LEADING MONOMIAL PROPERTY FOR POLYNOMIAL VECTORS OVER A RINGKuijper, M. / Schindelar, K. et al. | 2010
- 1138
-
AC-Tu-3.4: POLYNOMIALS WITH LINEAR STRUCTURE AND MAIORANA-MCFARLAND CONSTRUCTIONCharpin, P. / Sarkar, S. et al. | 2010
- 1143
-
AC-Tu-4.1: A BASIS FOR ALL SOLUTIONS OF THE KEY EQUATION FOR GABIDULIN CODESWachter, A. / Sidorenko, V. / Bossert, M. et al. | 2010
- 1148
-
AC-Tu-4.2: DECODING INTERLEAVED GABIDULIN CODES AND MULTISEQUENCE LINEARIZED SHIFT-REGISTER SYNTHESISSidorenko, V. / Bossert, M. et al. | 2010
- 1153
-
AC-Tu-4.3: PROPERTIES OF QUASI-UNIFORM CODESChan, T. / Grant, A. / Britz, T. et al. | 2010
- 1158
-
AC-Tu-4.4: QUASI-PERFECT GEOMETRICALLY UNIFORM CODES DERIVED FROM GRAPHS OVER GAUSSIAN INTEGER RINGSQuilles, C. / Palazzo, R. et al. | 2010
- 1163
-
AC-Tu-4.5: ON THE THRESHOLD OF MAXIMUM-DISTANCE SEPARABLE CODESKindarji, B. / Cohen, G. / Chabanne, H. et al. | 2010
- 1168
-
AC-We-2.1: PERFORMANCE ANALYSIS OF LINEAR CODES UNDER MAXIMUM LIKELIHOOD DECODING AT LOW RATESYagi, H. / Poor, H.V. et al. | 2010
- 1168
-
Performance analysis of linear codes under maximum likelihood decoding at low ratesYagi, Hideki / Poor, H.Vincent et al. | 2010
- 1173
-
AC-We-2.2: AN UPPER BOUND ON THE SEPARATING REDUNDANCY OF LINEAR BLOCK CODESAbdel-Ghaffar, K. / Weber, J. et al. | 2010
- 1178
-
AC-We-2.3: HIGH DIMENSIONAL ERROR-CORRECTING CODESYaakobi, E. / Etzion, T. et al. | 2010
- 1183
-
AC-We-2.4: ON THE MINIMUM WEIGHT PROBLEM OF PERMUTATION CODES UNDER CHEBYSHEV DISTANCEShieh, M.-Z. / Tsai, S.-C. et al. | 2010
- 1188
-
AC-We-2.5: ON THE CLASSIFICATION OF SELF-DUAL ADDITIVE CODES OVER GF(9)Danielsen, L.E. et al. | 2010
- 1193
-
AC-Th-1.1: ALGEBRAIC LIST-DECODING ON THE OPERATOR CHANNELMahdavifar, H. / Vardy, A. et al. | 2010
- 1198
-
AC-Th-1.2: A LINK BETWEEN GURUSWAMI-SUDAN'S LIST-DECODING AND DECODING OF INTERLEAVED REED-SOLOMON CODESZeh, A. / Senger, C. et al. | 2010
- 1203
-
AC-Th-1.3: LOCAL-TESTABILITY AND SELF-CORRECTABILITY OF Q-ARY SPARSE LINEAR CODESMachmouchi, W. et al. | 2010
- 1208
-
AC-Th-2.1: FIXED-RATE TILING ENCODERS FOR 2-D CONSTRAINTSSharov, A. / Roth, R. et al. | 2010
- 1213
-
AC-Th-2.2: GENERALIZED BELIEF PROPAGATION ALGORITHM FOR THE CAPACITY OF MULTI-DIMENSIONAL RUN-LENGTH LIMITED CONSTRAINTSSabato, G. / Molkaraie, M. et al. | 2010
- 1218
-
AC-Th-2.3: MOMENT BALANCING TEMPLATES FOR (D, K) CONSTRAINED CODESCheng, L. / Ferreira, H. / Broere, I. et al. | 2010
- 1223
-
AC-Th-2.4: THE TRADEOFF FUNCTION FOR A CLASS OF RLL(D, K) CONSTRAINTSLouidor, E. et al. | 2010
- 1228
-
AC-Th-3.1: THE LINEAR COMPLEXITY OF BINARY SEQUENCES WITH OPTIMAL AUTOCORRELATIONWang, Q. / Du, X. et al. | 2010
- 1233
-
AC-Th-3.2: ON THE STRUCTURE OF M-ARY SIDELNIKOV SEQUENCES OF PERIOD P^{2M}-1Yu, N.Y. / Gong, G. et al. | 2010
- 1238
-
AC-Th-3.3: ON RECONSTRUCTING A SEQUENCE FROM ITS SUBSEQUENCE COMPOSITIONSAcharya, J. / Das, H. / Milenkovic, O. / Orlitsky, A. / Pan, S. et al. | 2010
- 1243
-
AC-Th-3.4: QUASI-HADAMARD MATRIXPark, K.-H. / Song, H.-Y. et al. | 2010
- 1248
-
AC-Th-4.1: GENERALIZING THE BLUM-ELIAS METHOD FOR GENERATING RANDOM BITS FROM MARKOV CHAINSZhou, H. / Bruck, J. et al. | 2010
- 1253
-
AC-Th-4.2: ON THE CONSTRUCTION OF BINARY SEQUENCE FAMILIES WITH LOW CORRELATION AND LARGE SIZESParampalli, U. / Tang, X. / Boztas, S. et al. | 2010
- 1258
-
AC-Th-4.3: GENERALIZED CONSTRUCTIONS OF POLYPHASE SEQUENCE FAMILIES USING SHIFT AND ADDITION OF MULTIPLICATIVE CHARACTER SEQUENCESYu, N.Y. / Gong, G. et al. | 2010
- 1263
-
AC-Th-4.4: A NEW FAMILY OF $P$-ARY DECIMATED SEQUENCES WITH LOW CORRELATIONKim, J.-Y. / Choi, S.-T. / No, J.-S. / Chung, H. et al. | 2010
- 1268
-
AC-Th-4.5: ON THE CROSS-CORRELATION OF A TERNARY $M$-SEQUENCE OF PERIOD $3^{4K+2}-1$ AND ITS DECIMATED SEQUENCE BY $\FRAC{(3^{2K+1}+1)^2}{8}$Choi, S.-T. / No, J.-S. / Chung, H. et al. | 2010
- 1272
-
AC-Fr-1.1: ON COLORINGS OF BIVARIATE RANDOM SEQUENCESMatus, F. / Kupsa, M. et al. | 2010
- 1277
-
AC-Fr-1.2: NEW BINOMIAL BENT FUNCTIONS OVER THE FINITE FIELDS OF ODD CHARACTERISTICHelleseth, T. / Kholosha, A. et al. | 2010
- 1282
-
AC-Fr-1.3: K-FOLD CYCLOTOMIC NUMBERS AND THEIR APPLICATIONS TO FREQUENCY-HOPPING SEQUENCESChung, J.-H. / Yang, K. et al. | 2010
- 1287
-
AC-Fr-1.4: THE HAUSDORFF DIMENSION OF THE HALTING SELF-SIMILAR SETS OF T-UNIVERSAL PREFIX-FREE MACHINESTadaki, K. et al. | 2010
- 1292
-
AC-Fr-2.1: A NEW CLASS OF TERNARY AND QUATERNARY SEQUENCES WITH TWO-LEVEL AUTOCORRELATIONHu, H. / Gong, G. et al. | 2010
- 1297
-
AC-Fr-2.2: CROSS CORRELATION OF NONBINARY NIHO-TYPE SEQUENCESLuo, J. et al. | 2010
- 1300
-
AC-Fr-2.3: NONBINARY SEQUENCES WITH PERFECT AND NEARLY PERFECT AUTOCORRELATIONSBoztas, S. / Parampalli, U. et al. | 2010
- 1305
-
AC-Fr-3.1: ON M-ARY BALANCED CODES WITH PARALLEL DECODINGPelusi, D. / Tallini, L. / Bose, B. et al. | 2010
- 1310
-
AC-Fr-3.2: NEAR MDS POSET CODES AND DISTRIBUTIONSBarg, A. / Purkayastha, P. et al. | 2010
- 1315
-
AC-Fr-3.3: ON CYCLIC LOWEST DENSITY MDS ARRAY CODES CONSTRUCTED USING STARTERSLi, M. / Shu, J. et al. | 2010
- 1320
-
AC-Fr-4.1: DNA SEQUENCES GENERATED BY $\MATHBB{Z}_{4}$-LINEAR CODESRocha, A. / Faria, L. / Kleinschmidt, J.H. / Palazzo, R. / Silva-Filho, M. et al. | 2010
- 1325
-
AC-Fr-4.2: ON CRITICAL RELATIVE DISTANCE OF DNA CODES FOR ADDITIVE STEM SIMILARITYD yachkov, A. / Voronina, A. / Macula, A. / Renz, T. / Rykov, V. et al. | 2010
- 1330
-
AC-Fr-4.3: ON THE SYNTHESIS OF STOCHASTIC FLOW NETWORKSZhou, H. / Chen, H.-L. / Bruck, J. et al. | 2010
- 1335
-
E-Mo-1.1: RENYI DIVERGENCE AND MAJORIZATIONvan Erven, T. / Harremoes, P. et al. | 2010
- 1340
-
E-Mo-1.2: MINIMAX LOWER BOUNDS VIA F-DIVERGENCESGuntuboyina, A. et al. | 2010
- 1345
-
E-Mo-1.3: JOINT RANGE OF F-DIVERGENCESHarremoes, P. / Vajda, I. et al. | 2010
- 1350
-
E-Mo-1.4: RELATING SOURCE CODING AND RESOLVABILITY: A DIRECT APPROACHUyematsu, T. et al. | 2010
- 1355
-
E-Mo-2.1: MUTUAL INFORMATION SADDLE POINTS IN CHANNELS OF EXPONENTIAL FAMILY TYPEColeman, T. / Raginsky, M. et al. | 2010
- 1360
-
E-Mo-2.2: AN ENTROPY INEQUALITY FOR Q-ARY RANDOM VARIABLES AND ITS APPLICATION TO CHANNEL POLARIZATIONSasoglu, E. et al. | 2010
- 1364
-
E-Mo-2.3: EXISTENCE OF NEW INEQUALITIES FOR REPRESENTABLE POLYMATROIDSChan, T. / Grant, A. / Kern, D. et al. | 2010
- 1369
-
E-Mo-2.4: THE ENTROPIES OF THE SUM AND THE DIFFERENCE OF TWO IID RANDOM VARIABLES ARE NOT TOO DIFFERENTMadiman, M. / Kontoyiannis, I. et al. | 2010
- 1373
-
E-Mo-3.1: INFORMATION-THEORETIC BOUNDS ON MODEL SELECTION FOR GAUSSIAN MARKOV RANDOM FIELDSWang, W. / Wainwright, M.J. / Ramchandran, K. et al. | 2010
- 1373
-
Information-theoretic bounds on model selection for Gaussian Markov random fieldsWang, Wei / Wainwright, Martin J. / Ramchandran, Kannan et al. | 2010
- 1378
-
E-Mo-3.2: DIVERGENCE OF INFORMATION-CRITERION BASED MARKOV ORDER ESTIMATORS FOR INFINITE MEMORY PROCESSESTalata, Z. et al. | 2010
- 1383
-
E-Mo-3.3: PREQUENTIAL PLUG-IN CODES THAT ACHIEVE OPTIMAL REDUNDANCY RATES EVEN IF THE MODEL IS WRONGGrunwald, P. / Kotlowski, W. et al. | 2010
- 1388
-
Necessary and sufficient conditions for high-dimensional salient feature subset recoveryTan, Vincent Y.F. / Johnson, Matthew / Willsky, Alan S. et al. | 2010
- 1388
-
E-Mo-3.4: NECESSARY AND SUFFICIENT CONDITIONS FOR HIGH-DIMENSIONAL SALIENT FEATURE SUBSET RECOVERYTan, V. / Johnson, M. / Willsky, A. et al. | 2010
- 1393
-
E-Mo-4.1: DECENTRALIZED MULTIHYPOTHESIS SEQUENTIAL DETECTIONWang, Y. / Mei, Y. et al. | 2010
- 1398
-
E-Mo-4.2: INFORMATION THEORETIC MODEL VALIDATION FOR CLUSTERINGBuhmann, J.M. et al. | 2010
- 1403
-
E-Mo-4.3: MDL HIERARCHICAL CLUSTERING FOR STEMMATOLOGYLai, P.-H. / Roos, T. / O Sullivan, J. et al. | 2010
- 1403
-
MDL hierarchical clustering for stemmatologyLai, Po-Hsiang / Teemu, Roos / O'Sullivan, Joseph A. et al. | 2010
- 1408
-
E-Mo-4.4: ON REGRET OF PARAMETRIC MISMATCH IN MINIMUM MEAN SQUARE ERROR ESTIMATIONFozunbal, M. et al. | 2010
- 1413
-
E-Mo-4.5: ENTROPY MEASURES VS. ALGORITHMIC INFORMATIONTeixeira, A. / Souto, A. / Matos, A. / Antunes, L. et al. | 2010
- 1418
-
E-Tu-1.1: A NEAR-OPTIMAL (MINIMAX) TREE-STRUCTURED PARTITION FOR MUTUAL INFORMATION ESTIMATIONSilva, J. / Narayanan, S. et al. | 2010
- 1423
-
E-Tu-1.2: ON DATA-DRIVEN HISTOGRAM-BASED ESTIMATION FOR MUTUAL INFORMATIONSilva, J. / Narayanan, S. et al. | 2010
- 1428
-
E-Tu-1.3: NON-PARAMETRIC ESTIMATION OF INTEGRAL PROBABILITY METRICSSriperumbudur, B. / Fukumizu, K. / Gretton, A. / Scholkopf, B. / Lanckriet, G. et al. | 2010
- 1433
-
E-Tu-1.4: UNIVERSAL ESTIMATION OF DIRECTED INFORMATIONZhao, L. / Permuter, H. / Kim, Y.-H. / Weissman, T. et al. | 2010
- 1438
-
E-Tu-2.1: ENTROPY AND THE HYPERPLANE CONJECTURE IN CONVEX GEOMETRYBobkov, S. / Madiman, M. et al. | 2010
- 1443
-
E-Tu-2.2: COMPRESSING A LONG RANGE DEPENDENT RENEWAL PROCESSOguz, B. / Anantharam, V. et al. | 2010
- 1448
-
E-Tu-2.3: MARKOV LEMMA FOR COUNTABLE ALPHABETSHo, S.-W. et al. | 2010
- 1453
-
E-Tu-2.4: FUNCTIONAL PROPERTIES OF MMSEWu, Y. / Verdu, S. et al. | 2010
- 1458
-
E-Tu-3.1: EMPIRICAL PROCESSES AND TYPICAL SEQUENCESRaginsky, M. et al. | 2010
- 1463
-
E-Tu-3.2: MMSE DIMENSIONWu, Y. / Verdu, S. et al. | 2010
- 1468
-
E-Tu-3.3: ENTROPY RATE OF CONTINUOUS-STATE HIDDEN MARKOV CHAINSHan, G. / Marcus, B. et al. | 2010
- 1473
-
E-Tu-3.4: OPTIMUM ESTIMATION VIA PARTITION FUNCTIONS AND INFORMATION MEASURESMerhav, N. et al. | 2010
- 1478
-
Universal hypothesis testing in the learning-limited regimeKelly, Benjamin G. / Tularak, Thitidej / Wagner, Aaron B. / Viswanath, Pramod et al. | 2010
- 1478
-
E-Tu-4.1: UNIVERSAL HYPOTHESIS TESTING IN THE LEARNING-LIMITED REGIMEKelly, B. / Tularak, T. / Wagner, A. / Viswanath, P. et al. | 2010
- 1483
-
E-Tu-4.2: PATTERNS AND EXCHANGEABILITYSanthanam, N. / Madiman, M. et al. | 2010
- 1488
-
E-Tu-4.3: MINIMAX REDUNDANCY FOR LARGE ALPHABETSSzpankowski, W. / Weinberger, M.J. et al. | 2010
- 1493
-
E-Tu-4.4: CLASSIfiCATION USING PATTERN PROBABILITY ESTIMATORSAcharya, J. / Das, H. / Orlitsky, A. / Pan, S. / Santhanam, N. et al. | 2010
- 1498
-
E-Tu-4.5: EXACT CALCULATION OF PATTERN PROBABILITIESAcharya, J. / Das, H. / Mohimani, H. / Orlitsky, A. / Pan, S. et al. | 2010
- 1503
-
Regularization for matrix completionKeshavan, Raghunandan H. / Montanari, Andrea et al. | 2010
- 1503
-
E-We-2.1: REGULARIZATION FOR MATRIX COMPLETIONKeshavan, R. / Montanari, A. et al. | 2010
- 1508
-
E-We-2.2: INFORMATION THEORETIC BOUNDS FOR LOW-RANK MATRIX COMPLETIONVishwanath, S. et al. | 2010
- 1513
-
E-We-2.3: DENSE ERROR CORRECTION FOR LOW-RANK MATRICES VIA PRINCIPAL COMPONENT PURSUITGanesh, A. / Wright, J. / Li, X. / Candes, E. / Ma, Y. et al. | 2010
- 1518
-
E-We-2.4: STABLE PRINCIPAL COMPONENT PURSUITZhou, Z. / Li, X. / Wright, J. / Candes, E. / Ma, Y. et al. | 2010
- 1523
-
E-We-2.5: ON THE UNIQUENESS OF POSITIVE SEMIDEFINITE MATRIX SOLUTION UNDER COMPRESSED OBSERVATIONSXu, W. / Tang, A. et al. | 2010
- 1528
-
E-Th-1.1: THE DYNAMICS OF MESSAGE PASSING ON DENSE GRAPHS, WITH APPLICATIONS TO COMPRESSED SENSINGBayati, M. / Montanari, A. et al. | 2010
- 1533
-
E-Th-1.2: STATISTICAL MECHANICAL ANALYSIS OF A TYPICAL RECONSTRUCTION LIMIT OF COMPRESSED SENSINGKabashima, Y. / Wadayama, T. / Tanaka, T. et al. | 2010
- 1538
-
E-Th-1.3: STATISTICAL MECHANICAL ANALYSIS OF COMPRESSED SENSING UTILIZING CORRELATED COMPRESSION MATRIXTakeda, K. / Kabashima, Y. et al. | 2010
- 1543
-
E-Th-1.4: EXTENSION OF REPLICA ANALYSIS TO MAP ESTIMATION WITH APPLICATIONS TO COMPRESSED SENSINGRangan, S. / Fletcher, A. / Goyal, V. et al. | 2010
- 1548
-
E-Th-2.1: ``COMPRESSED'' COMPRESSED SENSINGReeves, G. / Gastpar, M. et al. | 2010
- 1553
-
E-Th-2.2: SAMPLE COMPLEXITY FOR 1-BIT COMPRESSED SENSING AND SPARSE CLASSIFICATIONGupta, A. / Nowak, R. / Recht, B. et al. | 2010
- 1558
-
E-Th-2.3: PERFORMANCE TRADEOFFS FOR EXACT SUPPORT RECOVERY OF SPARSE SIGNALSJin, Y. / Kim, Y.-H. / Rao, B. et al. | 2010
- 1563
-
E-Th-2.4: IMPROVED BOUNDS FOR SPARSE RECOVERY FROM ADAPTIVE MEASUREMENTSHaupt, J. / Castro, R. / Nowak, R. et al. | 2010
- 1563
-
Improved bounds for sparse recovery from adaptive measurementsHaupt, Jarvis / Castro, Rui / Nowak, Robert et al. | 2010
- 1568
-
E-Th-3.1: MODEL SELECTION: TWO FUNDAMENTAL MEASURES OF COHERENCE AND THEIR ALGORITHMIC SIGNIFICANCEBajwa, W. / Calderbank, R. / Jafarpour, S. et al. | 2010
- 1568
-
Model selection: Two fundamental measures of coherence and their algorithmic significanceBajwa, Waheed U. / Calderbank, Robert / Jafarpour, Sina et al. | 2010
- 1573
-
E-Th-3.2: NEW RESTRICTED ISOMETRY RESULTS FOR NOISY LOW-RANK RECOVERYMohan, K. / Fazel, M. et al. | 2010
- 1578
-
E-Th-3.3: WHERE IS RANDOMNESS NEEDED TO BREAK THE SQUARE-ROOT BOTTLENECK?Kuppinger, P. / Durisi, G. / Bolcskei, H. et al. | 2010
- 1583
-
E-Th-3.4: ROBUST LOSSY DETECTION USING SPARSE MEASUREMENTS: THE REGULAR CASENarayanaswamy, B. / Negi, R. / Khosla, P. et al. | 2010
- 1588
-
E-Th-4.1: ON THE DYNAMICS OF $\ELL_1$ DECODING: A MICROSCOPIC APPROACHXu, W. / Tang, A. et al. | 2010
- 1593
-
E-Th-4.2: RECOVERY THRESHOLDS FOR $\ELL_1$ OPTIMIZATION IN BINARY COMPRESSED SENSINGStojnic, M. et al. | 2010
- 1598
-
E-Th-4.3: OPTIMAL INCORPORATION OF SPARSITY INFORMATION BY WEIGHTED L_1 OPTIMIZATIONTanaka, T. / Raymond, J. et al. | 2010
- 1603
-
E-Th-4.4: IMPROVED SPARSE RECOVERY THRESHOLDS WITH TWO-STEP REWEIGHTED $\ELL_1$ MINIMIZATIONKhajehnejad, M.A. / Xu, W. / Avestimehr, A.S. / Hassibi, B. et al. | 2010
- 1608
-
E-Fr-1.1: HIGH-RATE VECTOR QUANTIZATION FOR THE NEYMAN-PEARSON DETECTION OF SOME STATIONARY MIXING PROCESSESVillard, J. / Bianchi, P. et al. | 2010
- 1613
-
E-Fr-1.2: ERROR EXPONENTS FOR COMPOSITE HYPOTHESIS TESTING OF MARKOV FOREST DISTRIBUTIONSTan, V. / Anandkumar, A. / Willsky, A. et al. | 2010
- 1618
-
E-Fr-1.3: FEATURE EXTRACTION FOR UNIVERSAL HYPOTHESIS TESTING VIA RANK-CONSTRAINED OPTIMIZATIONHuang, D. / Meyn, S. et al. | 2010
- 1623
-
E-Fr-1.4: ACTIVE M-ARY SEQUENTIAL HYPOTHESIS TESTINGNaghshvar, M. / Javidi, T. et al. | 2010
- 1628
-
E-Fr-2.1: ON MINIMAX ROBUST DETECTION OF STATIONARY GAUSSIAN SIGNALS IN WHITE GAUSSIAN NOISEZhang, W. / Poor, H.V. et al. | 2010
- 1633
-
E-Fr-2.2: ROBUST WAVEFORM DESIGN FOR MIMO RADARSGrossi, E. / Lops, M. / Venturino, L. / Tulino, A.M. et al. | 2010
- 1638
-
E-Fr-2.3: HIGH-DIMENSIONAL MATCHED SUBSPACE DETECTION WHEN DATA ARE MISSINGBalzano, L. / Recht, B. / Nowak, R. et al. | 2010
- 1643
-
E-Fr-2.4: TOWARDS ROBUST PHONEME CLASSIFICATION WITH HYBRID FEATURESYousafzai, J. / Cvetkovic, Z. / Sollich, P. et al. | 2010
- 1648
-
E-Fr-3.1: UNIVERSAL LOSSLESS COMPRESSION-BASED DENOISINGSu, H.-I. / Weissman, T. et al. | 2010
- 1653
-
E-Fr-3.2: TOWARD PROPERTIES OF TWICE-UNIVERSALITY IN DENOISINGOrdentlich, E. / Viswanathan, K. / Weinberger, M.J. et al. | 2010
- 1658
-
E-Fr-3.3: ON SPECTRAL ESTIMATORS OF BOOLEAN FUNCTIONSSchober, S. / Bossert, M. et al. | 2010
- 1663
-
E-Fr-3.4: ON ORDER RELATIONS BETWEEN LOWER BOUNDS ON THE MSE OF UNBIASED ESTIMATORSTodros, K. / Tabrikian, J. et al. | 2010
- 1668
-
E-Fr-4.1: LOCAL POPULARITY BASED COLLABORATIVE FILTERSBarman, K. / Dabeer, O. et al. | 2010
- 1673
-
E-Fr-4.2: EIGEN-INFERENCE FOR MULTI-SOURCE POWER ESTIMATIONCouillet, R. / Silverstein, J.W. / Debbah, M. et al. | 2010
- 1678
-
E-Fr-4.3: ESTIMATING THE INFORMATION RATE OF NOISY TWO-DIMENSIONAL CONSTRAINED CHANNELSMolkaraie, M. / Loeliger, H.-A. et al. | 2010
- 1683
-
E-Fr-4.4: FEEDBACK MESSAGE PASSING FOR INFERENCE IN GAUSSIAN GRAPHICAL MODELSLiu, Y. / Chandrasekaran, V. / Anandkumar, A. / Willsky, A. et al. | 2010
- 1688
-
N-Mo-1.1: TWO-WAY TRANSMISSION CAPACITY OF WIRELESS AD-HOC NETWORKSVaze, R. / Truong, K. / Heath, R. / Weber, S. et al. | 2010
- 1693
-
N-Mo-1.2: A NEW METHOD FOR COMPUTING THE TRANSMISSION CAPACITY OF NON-POISSON WIRELESS NETWORKSGanti, R.K. / Andrews, J.G. et al. | 2010
- 1698
-
N-Mo-1.3: INFORMATION-THEORETIC CAPACITY OF CLUSTERED RANDOM NETWORKSGaretto, M. / Nordio, A. / Chiasserini, C.F. / Leonardi, E. et al. | 2010
- 1703
-
N-Mo-1.4: PERFORMANCE OF INTERFERENCE ALIGNMENT IN CLUSTERED WIRELESS AD HOC NETWORKSTresch, R. / Guillaud, M. et al. | 2010
- 1708
-
N-Mo-2.1: ANALYSIS OF THE BENEFITS OF SUPERPOSITION CODING IN RANDOM WIRELESS NETWORKSVanka, S. / Haenggi, M. et al. | 2010
- 1713
-
N-Mo-2.2: CAPACITY SCALING OF WIRELESS AD HOC NETWORKS: EFFECT OF FINITE WAVELENGTHLee, S.-H. / Chung, S.-Y. et al. | 2010
- 1718
-
N-Mo-2.3: AN UPPER BOUND ON MULTI-HOP TRANSMISSION CAPACITY WITH DYNAMIC ROUTING SELECTIONChen, Y. / Andrews, J.G. et al. | 2010
- 1723
-
N-Mo-2.4: DEGREES OF FREEDOM OF LARGE PLANAR WIRELESS NETWORKS EMBEDDED IN A 3D DOMAINFranceschetti, M. / Migliore, M.D. / Minero, P. / Schettino, F. et al. | 2010
- 1728
-
N-Mo-3.1: LIMIT LAWS FOR RANDOM SPATIAL GRAPHICAL MODELSAnandkumar, A. / Yukich, J. / Willsky, A. et al. | 2010
- 1733
-
N-Mo-3.2: THE DELAY-OPTIMAL NUMBER OF HOPS IN POISSON MULTI-HOP NETWORKSStamatiou, K. / Haenggi, M. et al. | 2010
- 1738
-
N-Mo-3.3: FRACTIONAL BROWNIAN MODELS FOR VECTOR FIELD DATATafti, P. / Unser, M. et al. | 2010
- 1743
-
N-Mo-3.4: TRANSPORT CAPACITY AND CONNECTIVITY OF COGNITIVE RADIO NETWORKS WITH OUTAGE CONSTRAINTLi, C. / Dai, H. et al. | 2010
- 1748
-
N-Mo-4.1: THE MISSING PIECE SYNDROME IN PEER-TO-PEER COMMUNICATIONHajek, B. / Zhu, J. et al. | 2010
- 1753
-
N-Mo-4.2: WEIGHTED GOSSIP: DISTRIBUTED AVERAGING USING NON-DOUBLY STOCHASTIC MATRICESBenezit, F. / Blondel, V. / Thiran, P. / Tsitsiklis, J. / Vetterli, M. et al. | 2010
- 1753
-
Weighted Gossip: Distributed Averaging Using Non-doubly Stochastic MatricesBenezit, Florence / Blondel, Vincent / Thiran, Patrick / Tsitsiklis, John / Vetterli, Martin et al. | 2010
- 1758
-
N-Mo-4.3: TIGHT BOUNDS FOR ALGEBRAIC GOSSIP ON GRAPHSBorokhovich, M. / Avin, C. / Lotker, Z. et al. | 2010
- 1763
-
N-Mo-4.4: DISTRIBUTED CONSENSUS WITH FINITE MESSAGINGDash, D. / Sabharwal, A. et al. | 2010
- 1768
-
N-Mo-4.5: A NEAR-OPTIMAL ALGORITHM FOR NETWORK-CONSTRAINED AVERAGING WITH NOISY LINKSNoorshams, N. / Wainwright, M.J. et al. | 2010
- 1773
-
N-Tu-1.1: MINIMUM DELAY PACKET-SIZING FOR LINEAR MULTI-HOP NETWORKS WITH COOPERATIVE TRANSMISSIONSWen, N. / Berry, R. et al. | 2010
- 1778
-
N-Tu-1.2: AVOIDING INTERRUPTIONS - QOE TRADE-OFFS IN BLOCK-CODED STREAMING MEDIA APPLICATIONSParandehGheibi, A. / Medard, M. / Shakkottai, S. / Ozdaglar, A. et al. | 2010
- 1778
-
Avoiding Interruptions - QoE Trade-offs in Block-coded Streaming Media ApplicationsParandehGheibi, Ali / Medard, Muriel / Shakkottai, Srinivas / Ozdaglar, Asuman et al. | 2010
- 1783
-
N-Tu-1.3: MINIMIZING STREAMING DELAY IN HOMOGENEOUS PEER-TO-PEER NETWORKSJiang, J.W. / Zhang, S. / Chen, M. / Chiang, M. et al. | 2010
- 1788
-
N-Tu-1.4: DYNAMIC CODING AND RATE-CONTROL FOR SERVING DEADLINE-CONSTRAINED TRAFFIC OVER FADING CHANNELSGangammanavar, H. / Eryilmaz, A. et al. | 2010
- 1793
-
N-Tu-2.1: ON ARQ FOR PACKET ERASURE CHANNELS WITH BERNOULLI ARRIVALSVasudevan, D. / Subramanian, V. / Leith, D. et al. | 2010
- 1798
-
N-Tu-2.2: ON THE QUEUEING BEHAVIOR OF RANDOM CODES OVER A GILBERT-ELLIOT ERASURE CHANNELParag, P. / Chamberland, J.-F. / Pfister, H. / Narayanan, K. et al. | 2010
- 1803
-
N-Tu-2.3: NETWORK CAPACITY REGION OF MULTI-QUEUE MULTI-SERVER QUEUEING SYSTEM WITH TIME VARYING CONNECTIVITIESHalabian, H. / Lambadaris, I. / Lung, C.-H. et al. | 2010
- 1808
-
N-Tu-2.4: DELAY MINIMIZATION WITH A GENERAL PENTAGON RATE REGIONYang, J. / Ulukus, S. et al. | 2010
- 1813
-
N-Tu-3.1: MEDIUM ACCESS CONTROL VIA NEAREST-NEIGHBOR INTERACTIONS FOR REGULAR WIRELESS NETWORKSHui, K.H. / Guo, D. / Berry, R. et al. | 2010
- 1818
-
N-Tu-3.2: JAMMING GAMES FOR POWER CONTROLLED MEDIUM ACCESS WITH DYNAMIC TRAFFICSagduyu, Y. / Berry, R. / Ephremides, A. et al. | 2010
- 1823
-
N-Tu-3.3: A CHANNEL CODING APPROACH FOR RANDOM ACCESS COMMUNICATION WITH BURSTY SOURCESLuo, J. / Ephremides, A. et al. | 2010
- 1828
-
N-Tu-3.4: CONSTRUCTION OF SHORT PROTOCOL SEQUENCES WITH WORST-CASE THROUGHPUT GUARANTEEShum, K.W. / Wong, W.S. et al. | 2010
- 1833
-
N-Tu-4.1: TOWARDS OPTIMUM COST IN MULTI-HOP NETWORKS WITH ARBITRARY NETWORK DEMANDSViswanatha, K. / Akyol, E. / Rose, K. et al. | 2010
- 1838
-
N-Tu-4.2: COOPERATIVE RELIABILITY FOR STREAMING MULTIPLE ACCESSShkel, Y. / Draper, S. et al. | 2010
- 1843
-
N-Tu-4.3: DELAY OPTIMAL POWER CONTROL AND RELAY SELECTION FOR TWO-HOP COOPERATIVE OFDM SYSTEMS VIA DISTRIBUTIVE STOCHASTIC LEARNINGWang, R. / Lau, V.K.N. / Huang, H. et al. | 2010
- 1848
-
N-Tu-4.4: GEOMETRIC APPROXIMATIONS OF SOME ALOHA-LIKE STABILITY REGIONSXie, N. / Weber, S. et al. | 2010
- 1853
-
N-We-2.1: COMMUNICATING THE SUM OF SOURCES IN A 3-SOURCES/3-TERMINALS NETWORK; REVISITEDLangberg, M. / Ramamoorthy, A. et al. | 2010
- 1858
-
N-We-2.2: A NECESSARY AND SUFFICIENT CONDITION FOR SOLVABILITY OF A $3S/3T$ SUM-NETWORKShenvi, S. / Dey, B.K. et al. | 2010
- 1863
-
N-We-2.3: OPTIMAL ORDERING OF TRANSMISSIONS FOR COMPUTING BOOLEAN THRESHOLD FUNCTIONSKowshik, H. / Kumar, P.R. et al. | 2010
- 1868
-
N-We-2.4: INFINITE-MESSAGE INTERACTIVE FUNCTION COMPUTATION IN COLLOCATED NETWORKSMa, N. / Ishwar, P. et al. | 2010
- 1873
-
N-We-2.5: OPTIMAL COMPUTATION OF SYMMETRIC BOOLEAN FUNCTIONS IN TREE NETWORKSKowshik, H. / Kumar, P.R. et al. | 2010
- 1878
-
N-Th-1.1: NETWORK CODING FOR MULTIPLE UNICASTS: AN INTERFERENCE ALIGNMENT APPROACHDas, A. / Vishwanath, S. / Jafar, S. / Markopoulou, A. et al. | 2010
- 1883
-
N-Th-1.2: DEDI: A FRAMEWORK FOR ANALYZING RANK EVOLUTION OF RANDOM NETWORK CODING IN A WIRELESS NETWORKZhang, D. / Mandayam, N. / Parekh, S. et al. | 2010
- 1888
-
N-Th-1.3: A RANDOMIZED ALGORITHM AND PERFORMANCE BOUNDS FOR CODED COOPERATIVE DATA EXCHANGESprintson, A. / Sadeghi, P. / Booker, G. / El Rouayheb, S. et al. | 2010
- 1893
-
N-Th-1.4: ON THE CAPACITY OF WIRELESS 1-HOP INTERSESSION NETWORK CODING - A BROADCAST PACKET ERASURE CHANNEL APPROACHWang, C.-C. et al. | 2010
- 1898
-
N-Th-2.1: RATE-OF-DECAY OF PROBABILITY OF ISOLATION IN DENSE SENSOR NETWORKS WITH BOUNDING CONSTRAINTSSingh, A. / Elia, P. / Slock, D. et al. | 2010
- 1903
-
N-Th-2.2: ON ALGEBRAIC TRACEBACK IN DYNAMIC NETWORKSDas, A. / Agrawal, S. / Vishwanath, S. et al. | 2010
- 1908
-
N-Th-2.3: ON THE CODE LENGTH OF TCAM CODING SCHEMESRottenstreich, O. / Keslassy, I. et al. | 2010
- 1913
-
N-Th-2.4: GRAPH-CONSTRAINED GROUP TESTINGCheraghchi, M. / Karbasi, A. / Mohajer, S. / Saligrama, V. et al. | 2010
- 1918
-
N-Th-3.1: DATA MOVEMENT AND AGGREGATION IN FLASH MEMORIESJiang, A. / Langberg, M. / Mateescu, R. / Bruck, J. et al. | 2010
- 1923
-
N-Th-3.2: CODING FOR SENSING IN CONTENT ADDRESSABLE MEMORIESLastras-Montano, L.A. / Franceschini, M.M. / Rajendran, B. / Lam, C. et al. | 2010
- 1928
-
N-Th-3.3: LOW COMPLEXITY CODES FOR WRITING A WRITE-ONCE MEMORY TWICEWu, Y. et al. | 2010
- 1933
-
N-Th-3.4: MULTIPLE ERROR-CORRECTING WOM-CODESYaakobi, E. / Siegel, P. / Vardy, A. / Wolf, J. et al. | 2010
- 1938
-
N-Th-4.1: EXPLICIT AND OPTIMAL EXACT-REGENERATING CODES FOR THE MINIMUM-BANDWIDTH POINT IN DISTRIBUTED STORAGERashmi, K.V. / Shah, N.B. / Kumar, P.V. / Ramchandran, K. et al. | 2010
- 1943
-
N-Th-4.2: A FLEXIBLE CLASS OF REGENERATING CODES FOR DISTRIBUTED STORAGEShah, N.B. / Rashmi, K.V. / Kumar, P.V. et al. | 2010
- 1948
-
N-Th-4.3: SECURITY IN DISTRIBUTED STORAGE SYSTEMS BY COMMUNICATING A LOGARITHMIC NUMBER OF BITSDikaliotis, T.K. / Dimakis, A.G. / Ho, T. et al. | 2010
- 1953
-
N-Th-4.4: SECURE DISTRIBUTED STORAGE OF DECENTRALIZED SOURCE DATA: CAN INTERACTION HELP?El Rouayheb, S. / Prabhakaran, V. / Ramchandran, K. et al. | 2010
- 1958
-
N-Th-4.5: MEMORY ALLOCATION IN DISTRIBUTED STORAGE NETWORKSSardari, M. / Restrepo, R. / Fekri, F. / Soljanin, E. et al. | 2010
- 1958
-
Memory Allocation In Distributed Storage NetworksSardari, Mohsen / Restrepo, Ricardo / Fekri, Faramarz / Soljanin, Emina et al. | 2010
- 1963
-
N-Fr-1.1: SMALL ENSEMBLES OF SAMPLING MATRICES CONSTRUCTED FROM CODING THEORYBarg, A. / Mazumdar, A. et al. | 2010
- 1963
-
Small ensembles of sampling matrices constructed from coding theoryBarg, Alexander / Mazumdar, Arya et al. | 2010
- 1968
-
N-Fr-1.2: A SIMPLE MESSAGE-PASSING ALGORITHM FOR COMPRESSED SENSINGChandar, V. / Shah, D. / Wornell, G.W. et al. | 2010
- 1968
-
A simple message-passing algorithm for compressed sensingChandar, Venkat / Shah, Devavrat / Wornell, Gregory W. et al. | 2010
- 1973
-
N-Fr-1.3: SPARSE RECONSTRUCTION VIA THE REED-MULLER SIEVECalderbank, R. / Howard, S. / Jafarpour, S. et al. | 2010
- 1978
-
N-Fr-1.4: WORST CONFIGURATIONS (INSTANTONS) FOR COMPRESSED SENSING OVER REALS: A CHANNEL CODING APPROACHChilappagari, S.K. / Chertkov, M. / Vasic, B. et al. | 2010
- 1978
-
Worst configurations (instantons) for compressed sensing over reals: a channel coding approachChilappagari, Shashi Kiran / Chertkov, Michael / Vasic, Bane et al. | 2010
- 1983
-
N-Fr-2.1: A NOVEL RATE ALLOCATION METHOD FOR MULTILEVEL CODED MODULATIONBeygi, L. / Agrell, E. / Karlsson, M. / Makki, B. et al. | 2010
- 1988
-
N-Fr-2.2: CODING VERSUS FEEDBACK: HYBRID ARQ PROTOCOLS FOR THE PACKET ERASURE CHANNELPuducheri, S. / Fuja, T. et al. | 2010
- 1993
-
N-Fr-2.3: OPTIMAL ERROR CONTROL CODING FOR ITERATIVE CANCELLATION SYSTEMSSchlegel, C. / Burnashev, M. et al. | 2010
- 1998
-
N-Fr-2.4: CHANNEL DECODING WITH A BAYESIAN EQUALIZERSalamanca, L. / Murillo-Fuentes, J.J. / Perez-Cruz, F. et al. | 2010
- 2003
-
N-Fr-3.1: RECONSTRUCTION OF A TURBO-CODE INTERLEAVER FROM NOISY OBSERVATIONCote, M. / Sendrier, N. et al. | 2010
- 2008
-
N-Fr-3.2: METHODS FOR THE RECONSTRUCTION OF PARALLEL TURBO CODESCluzeau, M. / Finiasz, M. / Tillich, J.-P. et al. | 2010
- 2013
-
N-Fr-3.3: STOPPING SET ANALYSIS OF 3-DIMENSIONAL TURBO CODE ENSEMBLESAmat, A.G.i. / Rosnes, E. et al. | 2010
- 2018
-
N-Fr-3.4: IRREGULAR TURBO CODES IN BLOCK-FADING CHANNELSKraidy, G. / Boutros, J. / Fabregas, A.G.i. et al. | 2010
- 2023
-
N-Fr-4.1: TERMINATION AND TAILBITING OF RATE-K/N DIRECT PRODUCT CONVOLUTIONAL CODESVatta, F. / Sidorenko, V. / Bossert, M. et al. | 2010
- 2028
-
N-Fr-4.2: UEP-OPTIMAL CONVOLUTIONAL ENCODERS WITH SMALLEST MCMILLAN DEGREEWang, C.-H. / Wu, W.-F. / Weng, J.-J. et al. | 2010
- 2033
-
W-Mo-1.1: INTERFERENCE FOCUSING FOR MITIGATING CROSS-PHASE MODULATION IN A SIMPLIFIED OPTICAL FIBER MODELGhozlan, H. / Kramer, G. et al. | 2010
- 2033
-
Interference focusing for mitigating cross-phase modulation in a simplified optical fiber modelGhozlan, Hassan / Kramer, Gerhard et al. | 2010
- 2038
-
W-Mo-1.2: PPM DEMODULATION: ON APPROACHING FUNDAMENTAL LIMITS OF OPTICAL COMMUNICATIONSGuha, S. / Habif, J. / Takeoka, M. et al. | 2010
- 2038
-
PPM demodulation: On approaching fundamental limits of optical communicationsGuha, Saikat / Habif, Jonathan L. / Takeoka, Masahiro et al. | 2010
- 2043
-
W-Mo-1.3: PERFORMANCE ANALYSIS OF AN ASYNCHRONOUS MULTI-USER COMMUNICATION SYSTEM FOR OPTICAL NETWORKSVenturino, L. / Vaishampayan, V.A. / Feuer, M.D. / Wang, X. et al. | 2010
- 2048
-
W-Mo-1.4: HYBRID FREE-SPACE OPTICAL AND RADIO-FREQUENCY COMMUNICATIONS: OUTAGE ANALYSISLetzepis, N. / Nguyen, K.D. / Fabregas, A.G.i. / Cowley, W.G. et al. | 2010
- 2053
-
W-Mo-2.1: JOINT SCHEDULING AND HYBRID ARQ FOR MULTI-CELL MU-MIMO DOWNLINKShirani-Mehr, H. / Caire, G. / Papadopoulos, H. / Ramprashad, S. et al. | 2010
- 2053
-
Joint scheduling and hybrid ARQ for multi-cell MU-MIMO downlinkShirani-Mehr, H. / Caire, G. / Papadopoulos, H. / Ramprashad, S.A. et al. | 2010
- 2058
-
W-Mo-2.2: MULTI-CELL MIMO DOWNLINK WITH FAIRNESS CRITERIA: THE LARGE SYSTEM LIMITHuh, H. / Caire, G. / Moon, S.-H. / Lee, I. et al. | 2010
- 2063
-
W-Mo-2.3: ROBUST BEAMFORMING FOR MULTI-CELL DOWNLINK TRANSMISSIONTajer, A. / Prasad, N. / Wang, X. et al. | 2010
- 2068
-
Interference mitigation with joint beamforming and common message decoding in multicell systemsDahrouj, Hayssam / Yu, Wei et al. | 2010
- 2068
-
W-Mo-2.4: INTERFERENCE MITIGATION WITH JOINT BEAMFORMING AND COMMON MESSAGE DECODING IN MULTICELL SYSTEMSDahrouj, H. / Yu, W. et al. | 2010
- 2073
-
W-Mo-3.1: ROBUST COGNITIVE RADIO VIA GAME THEORYWang, J. / Scutari, G. / Palomar, D.P. et al. | 2010
- 2078
-
W-Mo-3.2: COEXISTENCE THROUGH ARQ RETRANSMISSIONS IN FADING COGNITIVE RADIO CHANNELSTannious, R. / Nosratinia, A. et al. | 2010
- 2083
-
W-Mo-3.3: FAIR RATE ADAPTATION IN MULTIUSER INTERFERENCE CHANNELSTajer, A. / Prasad, N. / Wang, X. et al. | 2010
- 2088
-
W-Mo-3.4: CAPACITY SCALING LAW BY MULTIUSER DIVERSITY IN COGNITIVE RADIO SYSTEMSHong, J.-P. / Choi, W. et al. | 2010
- 2093
-
W-Mo-4.1: NEW BOUNDS FOR THE SUM CAPACITY OF BINARY AND NONBINARY SYNCHRONOUS CDMA SYSTEMSDashmiz, S. / Takapoui, M.R. / Pad, P. / Marvasti, F. et al. | 2010
- 2098
-
W-Mo-4.2: ANALYSIS OF LARGE MIMO DS-CDMA SYSTEMS WITH IMPERFECT CSI AND SPATIAL CORRELATIONVehkapera, M. / Takeuchi, K. / Muller, R. / Tanaka, T. et al. | 2010
- 2103
-
W-Mo-4.3: LARGE SYSTEM ANALYSIS OF ITERATIVE MULTIUSER JOINT DECODING WITH AN UNCERTAIN NUMBER OF USERSCampo, A.T. / Fabregas, A.G.i. et al. | 2010
- 2108
-
W-Mo-4.4: REGULARIZED BLIND DETECTION FOR MIMO COMMUNICATIONSChi, Y. / Wu, Y. / Calderbank, R. et al. | 2010
- 2113
-
W-Mo-4.5: BELIEF PROPAGATION BASED MIMO DETECTION OPERATING ON QUANTIZED CHANNEL OUTPUTMezghani, A. / Nossek, J.A. et al. | 2010
- 2118
-
W-Tu-1.1: MAX-MIN WEIGHTED SIR FOR MIMO DOWNLINK SYSTEM: OPTIMALITY AND ALGORITHMSCai, D.W.H. / Quek, T.Q.S. / Tan, C.W. et al. | 2010
- 2123
-
W-Tu-1.2: A NEW ROBUST TRANSMISSION TECHNIQUE FOR THE MULTIUSER MIMO DOWNLINKWunder, G. / Schreck, J. / Jung, P. / Huang, H. / Valenzuela, R. et al. | 2010
- 2128
-
W-Tu-1.3: LARGE SYSTEM ANALYSIS OF PROJECTION BASED ALGORITHMS FOR THE MIMO BROADCAST CHANNELGuthy, C. / Utschick, W. / Honig, M. et al. | 2010
- 2133
-
W-Tu-1.4: CAPACITY SCALING OF MIMO BROADCAST CHANNELS WITH RANDOM USER DISTRIBUTIONSohn, I. / Andrews, J.G. / Lee, K.B. et al. | 2010
- 2138
-
W-Tu-2.1: JOINT FEC CODING AND LINEAR PRECODING FOR MIMO ISI CHANNELSXu, C. / Yuan, X. / Li, P. / Lin, X. et al. | 2010
- 2143
-
W-Tu-2.2: X- AND Y-CODES FOR MIMO PRECODINGMohammed, S.K. / Viterbo, E. / Hong, Y. / Chockalingam, A. et al. | 2010
- 2148
-
W-Tu-2.3: PRECODING WITH X-CODES TO INCREASE CAPACITY WITH DISCRETE INPUT ALPHABETSMohammed, S.K. / Viterbo, E. / Hong, Y. / Chockalingam, A. et al. | 2010
- 2153
-
W-Tu-2.4: ON THE CAPACITY ACHIEVING COVARIANCE MATRIX FOR FREQUENCY SELECTIVE MIMO CHANNELS USING THE ASYMPTOTIC APPROACHDupuy, F. / Loubaton, P. et al. | 2010
- 2158
-
W-Tu-3.1: DISTRIBUTED ROTATION RECOVERS SPATIAL DIVERSITYYang, S. / Belfiore, J.-C. et al. | 2010
- 2163
-
W-Tu-3.2: DIVERSITY OF MMSE MIMO RECEIVERSMehana, A.H. / Nosratinia, A. et al. | 2010
- 2168
-
W-Tu-3.3: OUTAGE DIVERSITY OF MIMO BLOCK-FADING CHANNELS WITH CAUSAL CHANNEL STATE INFORMATIONNguyen, K.D. / Letzepis, N. / Fabregas, A.G.i. / Rasmussen, L.K. et al. | 2010
- 2173
-
W-Tu-3.4: MULTIUSER SWITCHED SCHEDULING SYSTEMS WITH PER-USER THRESHOLD AND POST-USER SELECTIONNam, H. / Alouini, M.-S. et al. | 2010
- 2178
-
W-Tu-4.1: THE DIVERSITY-MULTIPLEXING TRADEOFF OF THE SYMMETRIC MIMO HALF-DUPLEX RELAY CHANNELKarmakar, S. / Varanasi, M. et al. | 2010
- 2183
-
W-Tu-4.2: ON THE DIVERSITY, MULTIPLEXING, AND ARRAY GAIN TRADEOFF IN MIMO CHANNELSOrdonez, L.G. / Palomar, D.P. / Fonollosa, J.R. et al. | 2010
- 2188
-
W-Tu-4.3: THE DIVERSITY-MULTIPLEXING TRADEOFF OF THE MIMO Z INTERFERENCE CHANNELKarmakar, S. / Varanasi, M. et al. | 2010
- 2193
-
W-Tu-4.4: DIVERSITY-MULTIPLEXING TRADEOFF IN MIMO GAUSSIAN INTERFERENCE CHANNELSLu, H.-F. et al. | 2010
- 2198
-
W-Tu-4.5: DIVERSITY-MULTIPLEXING-TRADEOFF-OPTIMAL 2-USER SCHEDULING IN AN M-USER GAUSSIAN MULTIPLE-ACCESS CHANNELGarg, M. / Varanasi, M.K. et al. | 2010
- 2203
-
W-We-2.1: FUNDAMENTAL RATE-RELIABILITY-COMPLEXITY LIMITS IN OUTAGE LIMITED MIMO COMMUNICATIONSElia, P. / Jalden, J. et al. | 2010
- 2208
-
W-We-2.2: DIVERSITY-MULTIPLEXING-DELAY TRADEOFFS IN MIMO MULTIHOP NETWORKS WITH ARQXie, Y. / Goldsmith, A. et al. | 2010
- 2213
-
W-We-2.3: THE DIVERSITY-MULTIPLEXING TRADEOFF OF THE SYMMETRIC MIMO 2-USER INTERFERENCE CHANNELKarmakar, S. / Varanasi, M. et al. | 2010
- 2218
-
W-We-2.4: DIVERSITY-MULTIPLEXING TRADEOFF AND OUTAGE PROBABILITY IN MIMO RELAY CHANNELSLevin, G. / Loyka, S. et al. | 2010
- 2223
-
W-We-2.5: DISTORTION OUTAGE PROBABILITY IN MIMO BLOCK-FADING CHANNELSPeng, L. / Fabregas, A.G.i. et al. | 2010
- 2228
-
W-Th-1.1: REDUCED ML-DECODING COMPLEXITY, FULL-RATE STBCS FOR 4 TRANSMIT ANTENNA SYSTEMSKoteshwar, P. / Rajan, B.S. et al. | 2010
- 2233
-
W-Th-1.2: TRAINING-SYMBOL EMBEDDED, HIGH-RATE COMPLEX ORTHOGONAL DESIGNS FOR RELAY NETWORKSHarshan, J. / Rajan, B.S. / Hjorungnes, A. et al. | 2010
- 2238
-
W-Th-1.3: ITERATIVE DATA DETECTION AND DECODING USING LIST CHANNEL ESTIMATION AND MARKOV CHAIN MONTE CARLOMao, X. / Chen, R.-R. / Farhang-Boroujeny, B. et al. | 2010
- 2238
-
Iterative data detection and decoding using list channel estimation and Markov Chain Monte CarloMao, Xuehong / Chen, Rong-Rong / Behrouz, Farhang-Boroujeny et al. | 2010
- 2243
-
W-Th-1.4: MODELLING THE DECODER AND DEMAPPER EXIT CHART CURVES IN BICM-ID SYSTEMS: BEC APPROXIMATIONSCarson, W. / Rodrigues, M. / Wassell, I. et al. | 2010
- 2248
-
W-Th-2.1: LATTICE SEQUENTIAL DECODER FOR CODED MIMO CHANNEL: PERFORMANCE AND COMPLEXITY ANALYSISAbediseid, W. / Damen, M.O. et al. | 2010
- 2253
-
W-Th-2.2: NEAR-ML DETECTION BASED ON SEMI-DEFINITE PROGRAMMING FOR UWB COMMUNICATIONSZhou, Q. / Ma, X. / Rice, R. et al. | 2010
- 2258
-
W-Th-2.3: SOFT-OUTPUT SPHERE DECODER FOR MULTIPLE-SYMBOL DIFFERENTIAL DETECTION OF IMPULSE-RADIO ULTRA-WIDEBANDSchenk, A. / Fischer, R.F.H. et al. | 2010
- 2263
-
W-Th-2.4: RANDOMIZED LATTICE DECODING: BRIDGING THE GAP BETWEEN LATTICE REDUCTION AND SPHERE DECODINGLiu, S. / Ling, C. / Stehle, D. et al. | 2010