Â鶹´«Ã½AV

2010 ISIT Student Paper Award Nominees
List of finalist papers that will be considered for the award. The award winners will be announced after the conference on the ITsoc Web.
Jun 9, 2010

The Information Theory Society Student Paper Award recognizes outstanding papers presented (by a student author) at the Â鶹´«Ã½AV International Symposium on Information Theory. The award is given on the basis of both the technical content of the paper and the quality of the presentation, and the student(s) must be the primary contributor(s) to the paper.Ìý

ISIT 2010 received more than 250 papers eligible for this award. Based on the TPC recommendations, review scores and after its own reading, evaluation and deliberation, the IT Society Award Committee selected 44 finalists, listed here below. The winner(s) of the 2010 ISIT Student paper Award will be determined and announced soon after the conference, by June 26, 2010.
Ìý

Paper # Title of the Paper Student Author
1136Ìý On the deletion channel with small deletion probability Kanoria
1139 Gaussian MIMO Broadcast Channels with Common and Confidential Messages Ekrem
1142 MMSE Dimension Wu
1207 Secure Computing Tyagi
1268 Fixed-Rate Tiling Encoders for 2-D Constraints Sharov
1273 On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding Nitinawarat
1329 Universal Hypothesis Testing in the Learning-Limited Regime Kelly
1347 On an Outer bound and an Inner Bound for the General Broadcast Channel Gohari
1357 Variable-length coding with feedback in the non-asymptotic regime Polyanskiy
1404 Graph-Constrained Group Testing Cheraghchi
1409 Codes in Permutations and Error Correction for Rank Modulation Mazumdar
1412 Near MDS poset codes and distributions Purkayastha
1422 High-Dimensional Matched Subspace Detection When Data are Missing Balzano
1435 Multiple Error-Correcting WOM-Codes Yaakobi
1547 Moderate Deviation Analysis of Channel Coding: Discrete Memoryless Case Altug
1560 Information-theoretic bounds on model selection for Gaussian Markov random fields Wang
1578 On Optimality of a Hybrid Digital/Analog Scheme for Wyner-Ziv Coding over Broadcast Channels Gao
1634 Linear Sum Capacity for Gaussian Multiple Access Channel with Feedback Ardestanizadeh
1661 Entropy Measures vs. Algorithmic Information Teixeira
1750 Stable Principal Component Pursuit Zhou
1802 Function computation via subspace coding Karamchandani
1828 A Fokker-Planck Differential Equation Approach for the Zero-Dispersion Optical Fiber Channel Isvand Yousefi
1853 Exact-Repair MDS Codes for Distributed Storage Using Interference Alignment Suh
1858 Geometric approximations of some Aloha-like stability regions Xie
1869 Generalizing the Blum-Elias Method for Generating Random Bits from Markov Chains Zhou
1911 On the scaling of Polar Codes: II. The behavior of un-polarized channels Hassani
1916 On Order Relations Between Lower Bounds on the MSE of Unbiased Estimators Todros
1919 On Distance Properties of Quasi-Cyclic Protograph-Based LDPC Codes Butler
1927 Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes Mahdavifar
2008 Modeling Location Uncertainty for Eavesdroppers: A Secrecy Graph Approach Goel
2048 On Reconstructing a Sequence from its Subsequence Compositions Acharya
2088 Improved Sparse Recovery Thresholds with Two-Step Reweighted $\ell_1$ Minimization Khajehnejad
2114 Optimal ordering of transmissions for computing Boolean threshold functions Kowshik
2120 On Secure Distributed Data Storage Under Repair Dynamics Pawar
2122 Model Selection: Two Fundamental Measures of Coherence and Their Algorithmic Significance Bajwa
1783 Operational Duality between Gelfand-Pinsker and Wyner-Ziv Coding Gupta
1579 An entropy inequality for q-ary random variables and its application to channel polarization Sasoglu
1664 One-Shot Capacity of Discrete Channels Costa
1875 LDPC Codes for Rank Modulation in Flash Memories Zhang
2104 Polytope Codes Against Adversaries in Networks Kosut
1532 Complex Low Density Lattice Codes Yona
1810 A Posterior Matching Scheme for Finite-State Channels with Feedback Bae
1928 Distributed signal cancelation inspired by Witsenhausen's counterexample Grover
2051 Network Coding for Multiple Unicasts: An Interference Alignment Approach ÌýDas