Non-Refereed Conference Papers

[1]

J. N. Laneman and G. W. Wornell, “Exploiting Distributed Spatial Diversity in Wireless Networks,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2000.

[2]

S. Kotagiri and J. N. Laneman, “Achievable Rates for Multiple Access Channels with State Information Known at One Encoder,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2004.

[3]

D. Chen and J. N. Laneman, “Cooperative Diversity for Wireless Fading Channels without Channel State Information,” in Proc. Asilomar Conf. Signals, Systems, and Computers, Monterey, CA, Nov. 2004, pp. 1307–1312. doi: 10.1109/acssc.2004.1399364.

[4]

W. Zhang and J. N. Laneman, “An Induced Additive-Noise Model for Non-Coherent Discrete-Time Memoryless Rayleigh Fading Channels,” in Proc. Conf. Inform. Sci. and Syst. (CISS), Baltimore, MD, Mar. 2005.

[5]

B. P. Dunn and J. N. Laneman, “Characterizing Source-Channel Diversity Approaches Beyond the Distortion Exponent,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sept. 2005.

[6]

S. Kotagiri and J. N. Laneman, “Reversible Information Embedding in Multi-user Channels,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sept. 2005.

[7]

W. Zhang and J. N. Laneman, “How Good is Phase-Shift Keying for Peak-Limited Fading Channels in the Low-SNR Regime,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sept. 2005. doi: 10.48550/arxiv.cs/0508121.

[8]

J. N. Laneman, “On the Distribution of Mutual Information,” in Proc. Workshop on Information Theory and its Applications (ITA), San Diego, CA, Feb. 2006. doi: 10.1109/icc.2005.1494518.

[9]

D. Chen and J. N. Laneman, “The Diversity-Multiplexing Tradeoff for the Multi-Access Relay Channel,” in Proc. Conf. Inform. Sci. and Syst. (CISS), Princeton, NJ, Mar. 2006, pp. 1324–1328.

[10]

D. Chen, M. Haenggi, and J. N. Laneman, “Distributed Spectrum-Efficient Routing Algorithms in Wireless Networks,” in Proc. Conf. Inform. Sci. and Syst. (CISS), Baltimore, MD, Mar. 2007, pp. 649–654. doi: 10.1109/t-wc.2008.070413.

[11]

M. Bloch and J. N. Laneman, “On the Secrecy Capacity of Arbitrary Wiretap Channels,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sept. 2008, pp. 818–825. doi: 10.1109/allerton.2008.4797642.

[12]

U. Kumar, V. Gupta, and J. N. Laneman, “On Communication across Line Networks with Feedback using Consensus Based Schemes,” in Proc. Workshop on Information Theory and its Applications (ITA), San Diego, CA, Feb. 2009.

[13]

M. Bloch and J. N. Laneman, “Information-Spectrum Methods for Information-Theoretic Security,” in Proc. Workshop on information theory and its applications (ITA), San Diego, CA, Feb. 2009, pp. 23–28. doi: 10.1109/ita.2009.5044918.

[14]

G. J. Bradford and J. N. Laneman, “An Experimental Framework for Evaluating Cooperative Diversity,” in Proc. Conf. Inform. Sci. and Syst. (CISS), Baltimore, MD, Mar. 2009, pp. 641–645. doi: 10.1109/ciss.2009.5054797.

[15]

E. MolavianJazi, M. Bloch, and J. N. Laneman, “Arbitrary Jamming Can Preclude Secure Communication,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sept. 2009, pp. 1069–1075. doi: 10.1109/allerton.2009.5394876.

[16]

P. Hesami and J. N. Laneman, “Limiting Behavior of Receive Antennae Selection,” in Proc. Conf. Inform. Sci. and Syst. (CISS), Baltimore, MD, Mar. 2011, pp. 1–6. doi: 10.1109/ciss.2011.5766166.

[17]

M. Khoshnevisan and J. N. Laneman, “Minimum Delay Communication in Energy Harvesting Systems over Fading Channels,” in Proc. Conf. Inform. Sci. and Syst. (CISS), Baltimore, MD, Mar. 2011, pp. 1–5. doi: 10.1109/ciss.2011.5766195.

[18]

P. Hesami and J. N. Laneman, “Low-Complexity Incremental Use of Multiple Transmitters in Wireless Communication Systems,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sept. 2011, pp. 1613–1618. doi: 10.1109/allerton.2011.6120361.

[19]

E. MolavianJazi and J. N. Laneman, “Multiaccess Communication in the Finite Blocklength Regime,” in Proc. Workshop on Information Theory and its Applications (ITA), San Diego, CA, Feb. 2012.

[20]

E. MolavianJazi and J. N. Laneman, “A Random Coding Approach to Gaussian Multiple Access Channels with Finite Blocklength,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2012, pp. 286–293. doi: 10.1109/allerton.2012.6483231.

[21]

M. Khoshnevisan and J. N. Laneman, “Intermittent Communication and Partial Divergence,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2012, pp. 656–662. doi: 10.1109/allerton.2012.6483280.

[22]

M. Khoshnevisan and J. N. Laneman, “Upper Bounds on the Capacity of Binary Intermittent Communication,” in Proc. Workshop on Information Theory and its Applications (ITA), San Diego, CA, Feb. 2013, pp. 1–6. doi: 10.1109/ita.2013.6502946.

[23]

E. MolavianJazi and J. N. Laneman, “On the Second-Order Coding Rate of Non-Ergodic Fading Channels,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2013. doi: 10.1109/allerton.2013.6736577.

[24]

M. Cai and J. N. Laneman, “Database-Aided Distributed Channel Assignment in Spectrum Sharing,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2015, pp. 1158–1165. doi: 10.1109/allerton.2015.7447139.

[25]

H. Pezeshki and J. N. Laneman, “Anywhere Decoding: Low-Overhead Basestation Cooperation for Interference and Fading-Limited Wireless Environments,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2015, pp. 1286–1293. doi: 10.1109/allerton.2015.7447156.

[26]

M. Cai and J. N. Laneman, “Database- and Sensing-Based Distributed Spectrum Sharing: Flexible Physical-Layer Prototyping,” in Proc. Asilomar Conf. Signals, Systems, and Computers, Monterey, CA, Nov. 2015, pp. 1051–1057. doi: 10.1109/acssc.2015.7421299.

[27]

S. Golnarian, J. N. Laneman, and M. D. Lemmon, “On the Outage Performance of an IEEE 802.11 Broadcast Scheme in Vehicular Ad Hoc Networks,” in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sept. 2016, pp. 101–106. doi: 10.1109/allerton.2016.7852216.

[28]

K. Gao, N. J. Estes, B. Hochwald, J. Chisum, and J. N. Laneman, “Power-Performance Analysis of a Simple One-Bit Transceiver,” in Proc. Workshop on Information Theory and its Applications (ITA), San Diego, CA, Feb. 2017, pp. 1–10. doi: 10.1109/ita.2017.8023454.

[29]

K. Gao, J. N. Laneman, and B. Hochwald, “Beamforming with Multiple One-Bit Wireless Transceivers,” in Proc. Workshop on Information Theory and its Applications (ITA), San Diego, CA, Feb. 2018, pp. 1–9.

[30]

R. Berry, T. W. Hazlett, M. Honig, and J. N. Laneman, “Evaluating the CBRS Experiment,” in Proc. The Research Conference on Communications, Information and Internet Policy (TPRC), Washington, DC, Sept. 2023. doi: 10.2139/ssrn.4528763.

[31]

R. Murray and J. N. Laneman, “Modeling 5G Interference on a Weather Radiometer,” in United States National Committee of URSI National Radio Science Meeting (USNC-URSI NRSM), Boulder, CO, 2024, pp. 304–304. doi: 10.23919/USNC-URSINRSM60317.2024.10464601.

[32]

H. Sharma, X. Meng, J. N. Laneman, R. Bendlin, B. Hochwald, and J. Chisum, “Digitally-Modulated OOK Reconfigurable Intelligent Surfaces for Massively-Scalable Gbps Transmitters,” in United States National Committee of URSI National Radio Science Meeting (USNC-URSI NRSM), Boulder, CO, 2024, pp. 366–367. doi: 10.23919/USNC-URSINRSM60317.2024.10464479.

[33]

O. Mujumdar and J. N. Laneman, “Capacity of a Complex-Valued Gaussian Channel with Frequency Offset,” in Proc. Allerton Conf. Communications, Control, and Computing, Urbana, IL, Sept. 2024, pp. 1–8. doi: 10.1109/Allerton63246.2024.10735297.

[34]

Y. Peng and J. N. Laneman, “L-Band Mobile-Satellite Uplink Interference to GPS: Measurements and Simulations,” in United States National Committee of URSI National Radio Science Meeting (USNC-URSI NRSM), Boulder, CO, 2026. doi: 10.23919/USNC-URSINRSM60317.2024.10464601.