Some pre-prints of my papers are posted on arXiv.org. You may also find some pre-prints in my University of Toronto TSpace Collection.

The following list of publications is auto-generated from my CV. You may also filter by the following keywords:

Journal Papers

[J1] E. Agrell, M. Karlsson, F. Poletti, S. Namiki, X. Chen, L. A. Rusch, B. Puttnam, P. Bayvel, L. Schmalen, Z. Tao, F. R. Kschischang, A. Alvarado, B. Mukherjee, R. Casellas, X. Zhou, D. van Veen, G. Mohs, E. Wong, A. Mecozzi, M.-S. Alouini, E. Diamanti, and M. Uysal, Roadmap of optical communications

J. of Optics, vol. 26, 2024, (to appear). doi: 10.1088/2040-8986/ad261f

[J2] A. Asadzadeh, A. Ho, F. R. Kschischang, and S. C. Draper, Exploiting parity-polytope geometry in approximate and randomized scheduled ADMM-LP decoding

IEEE Trans. Commun., Mar. 27, 2024, (Early Access version). doi: 10.1109/TCOMM.2024.3382328

[J3] A. Y. Sukmadji and F. R. Kschischang, Performance-complexity-latency trade-offs of concatenated RS-BCH codes

IEEE Trans. Commun., Feb. 26, 2024, (Early Access version). doi: 10.1109/TCOMM.2024.3369731

[J4] R. Rafie Borujeny and F. R. Kschischang, Why constant-composition codes reduce nonlinear interference noise

J. Lightwave Techn., vol. 41, no. 14, pp. 4691–4698, Jul. 15, 2023. doi: 10.1109/JLT.2023.3244927

[J5] M. Shehadeh and F. R. Kschischang, A simple capacity-achieving scheme for channels with polarization-dependent loss

J. Lightwave Techn., vol. 41, no. 6, pp. 1712–1724, Mar. 15, 2023. doi: 10.1109/JLT.2022.3230266

[J6] A. Tasbihi and F. R. Kschischang, Practical considerations in direct detection under Tukey signalling

J. Lightwave Techn., vol. 41, no. 6, pp. 1658–1669, Mar. 15, 2023. doi: 10.1109/JLT.2022.3227006

[J7] A. Y. Sukmadji, U. Martı́nez-Peñas, and F. R. Kschischang, Zipper codes

J. Lightwave Techn., vol. 40, no. 19, pp. 6397–6407, Oct. 1, 2022. doi: 10.1109/JLT.2022.3193635

[J8] M. Shehadeh and F. R. Kschischang, Space–time codes from sum–rank codes

IEEE Trans. Info. Theory, vol. 68, no. 3, pp. 1614–1637, Mar. 2022. doi: 10.1109/TIT.2021.3129767

[J9] S. Tedik Başaran, G. Karabulut Kurt, and F. R. Kschischang, Wireless network reliability analysis for arbitrary network topologies

IEEE Trans. Vehicular Techn., vol. 71, no. 3, pp. 2788–2797, Mar. 2021. doi: 10.1109/TVT.2021.3136794

[J10] Q. Zhang and F. R. Kschischang, Multistage soliton phase and amplitude estimation

J. Lightwave Techn., vol. 40, no. 1, pp. 93–100, Jan. 1, 2022. doi: 10.1109/JLT.2021.3120671

[J11] A. Tasbihi and F. R. Kschischang, Direct detection under Tukey signalling

J. Lightwave Techn., vol. 39, no. 21, pp. 6845–6857, Nov. 1, 2021. doi: 10.1109/JLT.2021.3109852

[J12] B. Lian and F. R. Kschischang, Sequential decoding of short length binary codes: Performance versus complexity

IEEE Commun. Letters, vol. 25, no. 10, pp. 3195–3198, Oct. 2021. doi: 10.1109/LCOMM.2021.3095895

[J13] R. Rafie Borujeny and F. R. Kschischang, A signal-space distance measure for nondispersive optical fiber

IEEE Trans. Info. Theory, vol. 67, no. 9, pp. 5903–5921, Sep. 2021. doi: 10.1109/TIT.2021.3100931

[J14] Q. Zhang and F. R. Kschischang, Correlation-aided nonlinear spectrum detection

J. Lightwave Techn., vol. 39, no. 15, pp. 4923–4931, Aug. 1, 2021. doi: 10.1109/JLT.2021.3078700

[J15] M. Barakatain and F. R. Kschischang, Low-complexity rate- and channel-configurable concatenated codes

J. Lightwave Techn., vol. 39, no. 7, pp. 1976–1983, Apr. 1, 2021. doi: 10.1109/JLT.2020.3046473

[J16] S. E. Rumsey, S. C. Draper, and F. R. Kschischang, Information density in multi-layer resistive memories

IEEE Trans. Info. Theory, vol. 67, no. 3, pp. 1446–1460, Mar. 2021. doi: 10.1109/TIT.2020.3040255

[J17] A. Tasbihi and F. R. Kschischang, On the capacity of waveform channels under square-law detection of time-limited signals

IEEE Trans. Info. Theory, vol. 66, no. 11, pp. 6682–6687, Nov. 2020. doi: 10.1109/TIT.2020.2999889

[J18] M. Barakatain, D. Lentner, G. Böcherer, and F. R. Kschischang, Performance-complexity tradeoffs of concatenated fec for higher-order modulation

J. Lightwave Techn., vol. 38, no. 11, pp. 2944–2953, Jun. 1, 2020. doi: 10.1109/JLT.2020.2983912

[J19] U. Martı́nez-Peñas and F. R. Kschischang, Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes

IEEE Trans. Info. Theory, vol. 65, no. 12, pp. 7790–7805, Dec. 2019. doi: 10.1109/TIT.2019.2924888

[J20] M. Shehadeh, Q. Zhang, and F. R. Kschischang, Reduced-complexity nonlinear soliton amplitude estimators

IEEE Photonics Techn. Letters, vol. 31, no. 24, pp. 1933–1935, Dec. 15, 2019. doi: 10.1109/LPT.2019.2950189

[J21] A. Tasbihi and F. R. Kschischang, Maximum likelihood detection in a four-dimensional stokes-space receiver

IEEE Trans. Commun., vol. 67, no. 10, pp. 7016–7026, Oct. 2019. doi: 10.1109/TCOMM.2019.2932072

[J22] C. G. Blake and F. R. Kschischang, Upper and lower bounds on the computational complexity of polar encoding and decoding

IEEE Trans. Info. Theory, vol. 65, no. 9, pp. 5656–5673, Sep. 2019. doi: 10.1109/TIT.2019.2917683

[J23] U. Martı́nez-Peñas and F. R. Kschischang, Reliable and secure multishot network coding using linearized reed-solomon codes

IEEE Trans. Info. Theory, vol. 65, no. 8, pp. 4785–4803, Aug. 2019. doi: 10.1109/TIT.2019.2912165

[J24] Q. Zhang and F. R. Kschischang, Improved soliton amplitude estimation via the continuous spectrum

J. Lightwave Techn., vol. 37, no. 13, pp. 3087–3099, Jul. 1, 2019. doi: 10.1109/JLT.2019.2910519

[J25] U. Martı́nez-Peñas and F. R. Kschischang, Evaluation and interpolation over multivariate skew polynomial rings

J. of Algebra, vol. 525, pp. 111–139, May 2019. doi: 10.1016/j.jalgebra.2018.12.032

[J26] M. Barakatain and F. R. Kschischang, Corrections to “low-complexity concatenated LDPC-staircase codes”

J. Lightwave Techn., vol. 37, no. 3, pp. 1070–1070, Feb. 1, 2019. doi: 10.1109/JLT.2018.2880323

[J27] A. Ravagnani and F. R. Kschischang, Adversarial network coding

IEEE Trans. Info. Theory, vol. 65, no. 1, pp. 198–219, Jan. 2019. doi: 10.1109/TIT.2018.2865936

[J28] C. G. Blake and F. R. Kschischang, Energy, latency, and reliability tradeoffs in coding circuits

IEEE Trans. Info. Theory, vol. 65, no. 2, pp. 935–946, Feb. 2019. doi: 10.1109/TIT.2018.2865701

[J29] M. Barakatain and F. R. Kschischang, Low-complexity concatenated LDPC-staircase codes

J. Lightwave Techn., vol. 36, no. 12, pp. 2443–2449, Jun. 15, 2018. doi: 10.1109/JLT.2018.2812738

[J30] F. Leduc-Primeau, F. R. Kschischang, and W. J. Gross, Modeling and energy optimization of ldpc decoder circuits with timing violations

IEEE Trans. Commun., vol. 66, no. 3, pp. 932–946, Mar. 2018. doi: 10.1109/TCOMM.2017.2778247

[J31] L. M. Zhang, D. Truhachev, and F. R. Kschischang, Spatially coupled split-component codes with iterative algebraic decoding

IEEE Trans. Info. Theory, vol. 64, no. 1, pp. 205–224, Jan. 2018. doi: 10.1109/TIT.2017.2766238

[J32] S. Liu, F. Manganiello, and F. R. Kschischang, Matroidal structure of skew polynomial rings with application to network coding

Finite Fields and Their Applications, vol. 46, pp. 326–346, Jul. 2017. doi: 10.1016/j.ffa.2017.04.007

[J33] L. M. Zhang and F. R. Kschischang, Low-complexity soft-decision concatenated ldgm-staircase fec for high-bit-rate fiber-optic communication

J. Lightwave Techn., vol. 35, no. 18, pp. 3991–3999, Sep. 15, 2017. doi: 10.1109/JLT.2017.2716373

[J34] C. G. Blake and F. R. Kschischang, On the VLSI energy complexity of LDPC decoder circuits

IEEE Trans. Info. Theory, vol. 63, no. 5, pp. 2781–2795, May 2017. doi: 10.1109/TIT.2017.2673805

[J35] J. C. Cartledge, F. P. Guiomar, F. R. Kschischang, G. Liga, and M. P. Yankov, Digital signal processing for fiber nonlinearities

Optics Express, vol. 25, no. 3, pp. 1916–1936, Feb. 6, 2017. doi: 10.1364/OE.25.001916

[J36] C. Pan and F. R. Kschischang, Probabilistic 16-QAM shaping in WDM systems

J. Lightwave Techn., vol. 34, no. 18, pp. 4285–4292, Sep. 15, 2016. doi: 10.1109/JLT.2016.2594296

[J37] S. Hari and F. R. Kschischang, Bi-directional algorithm for computing discrete spectral amplitudes in the NFT

J. Lightwave Techn., vol. 34, no. 15, pp. 3529–3537, Aug. 1, 2016. doi: 10.1109/JLT.2016.2577702

[J38] S. Hari, M. I. Yousefi, and F. R. Kschischang, Multieigenvalue communication

J. Lightwave Techn., vol. 34, no. 13, pp. 3110–3117, Jul. 1, 2016. doi: 10.1109/JLT.2016.2551638

[J39] E. Agrell, M. Karlsson, A. R. Chraplyvy, D. J. Richardson, P. M. Krummrich, P. Winzer, K. Roberts, J. K. Fischer, S. J. Savory, B. J. Eggleton, M. Secondini, F. R. Kschischang, A. Lord, J. Prat, I. Tomkos, J. E. Bowers, S. Srinivasan, M. Brandt-Pearce, and N. Gisin, Roadmap of optical communications

J. of Optics, vol. 18, no. 6, May 3, 2016. doi: 10.1088/2040-8978/18/6/063002

[J40] C. Feng, D. Silva, and F. R. Kschischang, Blind compute-and-forward

IEEE Trans. Commun., vol. 64, no. 4, pp. 1451–1463, Apr. 2016. doi: 10.1109/TCOMM.2016.2538767

[J41] E. Agrell, A. Alvarado, and F. R. Kschischang, Implications of information theory in optical fibre communications

Phil. Trans. Royal Society, Part A, vol. 374, no. 2062, Mar. 6, 2016. doi: 10.1098/rsta.2014.0438

[J42] C. Pan, H. Bülow, W. Idler, L. Schmalen, and F. R. Kschischang, Optical nonlinear phase noise compensation for 9 × 32-gbaud polDM-16 QAM transmission using a code-aided expectation maximization algorithm

J. Lightwave Techn., vol. 33, no. 17, pp. 3679–3686, Sep. 1, 2015. doi: 10.1109/JLT.2015.2451108

[J43] Z. Dong, S. Hari, T. Gui, K. Zhong, M. I. Yousefi, C. Lu, P.-K.-A. Wai, F. R. Kschischang, and A. P.-T. Lau, Nonlinear frequency division multiplexed transmissions based on NFT

IEEE Photonics Techn. Letters, vol. 27, no. 15, pp. 1621–1623, Aug. 1, 2015. doi: 10.1109/LPT.2015.2432793

[J44] C. G. Blake and F. R. Kschischang, Energy consumption of VLSI decoders

IEEE Trans. Info. Theory, vol. 61, no. 6, pp. 3185–3198, Jun. 2015. doi: 10.1109/TIT.2015.2421520

[J45] C. Feng, R. W. Nobrega, F. R. Kschischang, and D. Silva, Communication over finite-chain-ring matrix channels

IEEE Trans. Info. Theory, vol. 60, no. 10, pp. 5899–5917, Oct. 2014. doi: 10.1109/TIT.2014.2346079

[J46] M. I. Yousefi and F. R. Kschischang, Information transmission using the nonlinear Fourier transform, Part I: Mathematical tools

IEEE Trans. Info. Theory, vol. 60, no. 7, pp. 4312–4328, Jul. 2014. doi: 10.1109/TIT.2014.2321143

[J47] M. I. Yousefi and F. R. Kschischang, Information transmission using the nonlinear Fourier transform, Part II: Numerical methods

IEEE Trans. Info. Theory, vol. 60, no. 7, pp. 4329–4345, Jul. 2014. doi: 10.1109/TIT.2014.2321151

[J48] M. I. Yousefi and F. R. Kschischang, Information transmission using the nonlinear Fourier transform, Part III: Spectrum modulation

IEEE Trans. Info. Theory, vol. 60, no. 7, pp. 4346–4369, Jul. 2014. doi: 10.1109/TIT.2014.2321155

[J49] L. Zhang and F. R. Kschischang, Staircase codes with 6% to 33% overhead

J. Lightwave Techn., vol. 32, no. 10, pp. 1999–2002, May 15, 2014. doi: 10.1109/JLT.2014.2316732

[J50] C. Pan and F. R. Kschischang, Code-aided phase tracking for coherent fiber channels

J. Lightwave Techn., vol. 32, no. 6, pp. 1041–1047, Mar. 15, 2014. doi: 10.1109/JLT.2013.2295773

[J51] S. Liu, F. Manganiello, and F. R. Kschischang, Koetter interpolation in skew polynomial rings

Designs, Codes, and Crypt., vol. 72, pp. 593–608, Sep. 2014. doi: 10.1007/s10623-012-9784-1

[J52] C. Feng, D. Silva, and F. R. Kschischang, An algebraic approach to physical-layer network coding

IEEE Trans. Info. Theory, vol. 59, no. 11, pp. 7576–7596, Nov. 2013. doi: 10.1109/TIT.2013.2274264

[J53] F. R. Kschischang and T. Lutz, A constrained coding approach to error-free half-duplex relay networks

IEEE Trans. Info. Theory, vol. 59, no. 10, pp. 6258–6260, Oct. 2013. doi: 10.1109/TIT.2013.2269671

[J54] L. Zhang and F. R. Kschischang, Multi-edge-type low-density parity-check codes for bandwidth-efficient modulation

IEEE Trans. Commun., vol. 61, no. 1, pp. 43–52, Jan. 2013. doi: 10.1109/TCOMM.2012.100512.120006

[J55] J. Karout, G. Kramer, F. R. Kschischang, and E. Agrell, A two-dimensional signal space for intensity-modulated channels

IEEE Commun. Letters, vol. 16, no. 9, pp. 1361–1364, Sep. 2012. doi: 10.1109/LCOMM.2012.072012.121057

[J56] S. Liu and F. R. Kschischang, A constrained coding alternative to MPPM

IEEE Trans. Commun., vol. 60, no. 4, pp. 1013–1019, Apr. 2012. doi: 10.1109/TCOMM.2012.020912.110117

[J57] B. P. Smith and F. R. Kschischang, A pragmatic coded modulation scheme for high-spectral-efficiency fiber-optic communications

J. Lightwave Techn., vol. 30, no. 13, pp. 2047–2053, Jul. 1, 2012. doi: 10.1109/JLT.2012.2185683

[J58] B. P. Smith, A. Farhood, A. Hunt, F. R. Kschischang, and J. Lodge, Staircase codes: FEC for 100 Gb/s OTN

J. Lightwave Techn., vol. 30, no. 1, pp. 110–117, Jan. 1, 2012. doi: 10.1109/JLT.2011.2175479

[J59] A. Alamdar-Yazdi and F. R. Kschischang, A simplified successive-cancellation decoder for polar codes

IEEE Commun. Letters, vol. 15, no. 12, pp. 1378–1380, Dec. 2011. doi: 10.1109/LCOMM.2011.101811.111480

[J60] M. I. Yousefi and F. R. Kschischang, On the per-sample capacity of nondispersive optical fibers

IEEE Trans. Info. Theory, vol. 57, no. 11, pp. 7522–7541, Nov. 2011. doi: 10.1109/TIT.2011.2165793

[J61] D. Silva and F. R. Kschischang, Universal secure network coding via rank-metric codes

IEEE Trans. Info. Theory, vol. 57, no. 2, pp. 1124–1135, Feb. 2011. doi: 10.1109/TIT.2010.2090212

[J62] M. Effros, G. D. Forney Jr., F. R. Kschischang, M. Médard, A. C. Singer, and A. Vardy, The scientific legacy of Ralf Koetter

IEEE Trans. Info. Theory, vol. 57, no. 2, pp. 589–592, Feb. 2011, introduction to the special issue. doi: 10.1109/TIT.2010.2102090

[J63] B. P. Smith and F. R. Kschischang, Future prospects for FEC in fiber-optic communications

IEEE J. Sel. Top. Quantum Electr., vol. 16, no. 5, pp. 1245–1257, Sep.–Oct. 2010. doi: 10.1109/JSTQE.2010.2044749

[J64] D. Wang, D. Silva, and F. R. Kschischang, Robust network coding in the presence of untrusted nodes

IEEE Trans. Info. Theory, vol. 56, no. 9, pp. 4532–4538, Sep. 2010. doi: 10.1109/TIT.2010.2054650

[J65] D. Silva, F. R. Kschischang, and R. Koetter, Communication over finite-field matrix channels

IEEE Trans. Info. Theory, vol. 56, no. 3, pp. 1296–1305, Mar. 2010. doi: 10.1109/TIT.2009.2039167

[J66] B. P. Smith, M. Ardakani, W. Yu, and F. R. Kschischang, Design of irregular LDPC codes with optimized performance-complexity tradeoff

IEEE Trans. Commun., vol. 58, no. 2, pp. 489–499, Feb. 2010. doi: 10.1109/TCOMM.2010.02.080193

[J67] A. Khaleghi, D. Silva, and F. R. Kschischang, Subspace codes

Lecture Notes in Computer Science, vol. 5921, 2009, (invited). doi: 10.1007/978-3-642-10868-6_1

[J68] D. Silva and F. R. Kschischang, On metrics for error correction in network coding

IEEE Trans. Info. Theory, vol. 55, pp. 5479–5490, Dec. 2009. doi: 10.1109/TIT.2009.2032817

[J69] S. C. Draper, F. R. Kschischang, and B. J. Frey, Rateless coding for arbitrary channel mixtures with decoder channel state information

IEEE Trans. Info. Theory, vol. 55, pp. 4119–4133, Sep. 2009. doi: 10.1109/TIT.2009.2025577

[J70] D. Silva, F. R. Kschischang, and R. Koetter, A rank-metric approach to error control in random network coding

IEEE Trans. Info. Theory, vol. 54, pp. 3951–3967, Sep. 2008. doi: 10.1109/TIT.2008.928291

[J71] V. Pechenkin and F. R. Kschischang, Pseudolinear optical system reach enhancement via runlength-limited coding

IEEE J. Selected Areas in Commun., vol. 26, pp. 66–72, Aug. 2008. doi: 10.1109/JSACOCN.2008.032107

[J72] A. Darabiha, A. C. Carusone, and F. R. Kschischang, Power reduction techniques for LDPC decoders

IEEE J. Solid State Circuits, vol. 43, pp. 1835–1845, Aug. 2008. doi: 10.1109/JSSC.2008.925402

[J73] R. Koetter and F. R. Kschischang, Coding for errors and erasures in random network coding

IEEE Trans. Info. Theory, vol. 54, pp. 3579–3591, Aug. 2008. doi: 10.1109/TIT.2008.926449

[J74] A. Darabiha, A. C. Carusone, and F. R. Kschischang, Block-interlaced LDPC decoders with reduced interconnect complexity

IEEE Trans. Circuits and Sys. II, vol. 55, pp. 74–78, Jan. 2008. doi: 10.1109/TCSII.2007.905328

[J75] H.-A. Loeliger, J. Dauwels, J. Hu, S. Korl, L. Ping, and F. R. Kschischang, The factor graph approach to model-based signal processing

Proc. IEEE, vol. 95, pp. 1295–1322, 2007. doi: 10.1109/JPROC.2007.896497

[J76] A. W. Eckford and F. R. Kschischang, A partial ordering of general finite-state Markov channels under LDPC decoding

IEEE Trans. Info. Theory, vol. 53, pp. 2072–2087, Jun. 2007. doi: 10.1109/TIT.2007.896877

[J77] W. J. Gross, F. R. Kschischang, and P. G. Gulak, Architecture and implementation of an interpolation processor for soft-decision Reed-Solomon decoding

IEEE Trans. VLSI Sys., vol. 15, pp. 309–318, Mar. 2007. doi: 10.1109/TVLSI.2007.893609

[J78] A. P. T. Lau and F. R. Kschischang, Feedback quantization strategies for multiuser diversity systems

IEEE Trans. Info. Theory, vol. 53, pp. 1386–1400, Apr. 2007. doi: 10.1109/TIT.2007.892784

[J79] A. W. Eckford, F. R. Kschischang, and S. Pasupathy, On designing good LDPC codes for Markov channels

IEEE Trans. Info. Theory, vol. 53, pp. 5–21, Jan. 2007. doi: 10.1109/TIT.2006.887467

[J80] V. Pechenkin and F. R. Kschischang, Constrained coding for quasi-linear optical data transmission systems

J. Lightwave Techn., vol. 24, pp. 4895–4902, Dec. 2006. doi: 10.1109/JLT.2006.884973

[J81] M. Ardakani and F. R. Kschischang, Gear-shift decoding

IEEE Trans. Commun., vol. 54, pp. 1235–1242, Jul. 2006. doi: 10.1109/TCOMM.2006.876885

[J82] W. J. Gross, F. R. Kschischang, and P. G. Gulak, Applications of algebraic soft-decision decoding of Reed-Solomon codes

IEEE Trans. Commun., vol. 54, pp. 1224–1234, Jul. 2006. doi: 10.1109/TCOMM.2006.877972

[J83] S. Hranilovic and F. R. Kschischang, A pixelated MIMO wireless optical communication system

IEEE J. Sel. Top. Quantum Electr., vol. 12, pp. 859–874, Jul.–Aug. 2006. doi: 10.1109/JSTQE.2006.876601

[J84] V. Pechenkin and F. R. Kschischang, Higher bit rates for dispersion-managed soliton communication systems via constrained coding

J. Lightwave Techn., vol. 24, pp. 1149–1158, Mar. 2006. doi: 10.1109/JLT.2005.863265

[J85] M. Ardakani, F. R. Kschischang, and W. Yu, Near-capacity coding for discrete multitone systems with impulse noise

EURASIP J. on Applied Signal Proc., vol. 2006, pp. 1–10, 2006, Article id=098738. doi: 10.1155/ASP/2006/98738

[J86] A. W. Eckford, F. R. Kschischang, and S. Pasupathy, Analysis of low-density parity-check codes for the Gilbert-Elliott channel

IEEE Trans. Info. Theory, vol. 51, pp. 3872–3889, Nov. 2005. doi: 10.1109/TIT.2005.856934

[J87] M. Ardakani and F. R. Kschischang, Properties of optimum binary message-passing decoders

IEEE Trans. Info. Theory, vol. 51, pp. 3658–3665, Oct. 2005. doi: 10.1109/TIT.2005.855611

[J88] T. H. Chan, S. Hranilovic, and F. R. Kschischang, Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs

IEEE Trans. Info. Theory, vol. 51, pp. 2073–2088, Jun. 2005. doi: 10.1109/TIT.2005.847707

[J89] Y. Mao and F. R. Kschischang, On factor graphs and the Fourier transform

IEEE Trans. Info. Theory, vol. 51, pp. 1635–1649, May 2005. doi: 10.1109/TIT.2005.846404

[J90] Y. Mao, F. R. Kschischang, B. Li, and S. Pasupathy, A factor graph approach to link loss monitoring in wireless sensor networks

IEEE J. Selected Areas in Commun., vol. 23, pp. 820–829, Apr. 2005. doi: 10.1109/JSAC.2005.843557

[J91] M. Ardakani, T. H. Chan, and F. R. Kschischang, EXIT-chart properties of the highest-rate LDPC code with desired convergence behavior

IEEE Commun. Letters, vol. 9, pp. 52–54, Jan. 2005. doi: 10.1109/LCOMM.2005.01003

[J92] W. J. Gross, F. R. Kschischang, R. Koetter, and P. G. Gulak, Towards a VLSI architecture for interpolation-based soft-decision Reed-Solomon decoders

J. VLSI Signal Proc., vol. 39, pp. 93–111, Jan.–Feb. 2005. doi: 10.1023/B:VLSI.0000047274.68702.8d

[J93] M. Ardakani and F. R. Kschischang, A more accurate one-dimensional analysis and design of irregular LDPC codes

IEEE Trans. Commun., vol. 52, pp. 2106–2114, Dec. 2004. doi: 10.1109/TCOMM.2004.838718

[J94] M. Ardakani, T. Esmailian, and F. R. Kschischang, Near-capacity coding in multicarrier modulation systems

IEEE Trans. Commun., vol. 52, pp. 1880–1889, Nov. 2004. doi: 10.1109/TCOMM.2004.836560

[J95] S. Hranilovic and F. R. Kschischang, Capacity bounds for power- and band-limited optical intensity channels corrupted by Gaussian noise

IEEE Trans. Info. Theory, vol. 50, pp. 784–795, May 2004. doi: 10.1109/TIT.2004.826649

[J96] F. R. Kschischang, Codes defined on graphs

IEEE Commun. Mag., vol. 41, pp. 118–125, Aug. 2003. doi: 10.1109/MCOM.2003.1222727

[J97] T. Esmailian, F. R. Kschischang, and P. G. Gulak, In-building power lines as high-speed communication channels: Channel characterization and a test-channel ensemble

Int. J. Commun. Sys., vol. 16, pp. 381–400, Jun. 2003. doi: 10.1002/dac.596

[J98] S. Hranilovic and F. R. Kschischang, Optical intensity-modulated directed detection channels: Signal space and lattice codes

IEEE Trans. Info. Theory, vol. 49, pp. 1385–1399, Jun. 2003. doi: 10.1109/TIT.2003.811928

[J99] F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, Factor graphs and the sum-product algorithm

IEEE Trans. Info. Theory, vol. 47, pp. 498–519, Feb. 2001. doi: 10.1109/18.910572

[J100] A. H. Banihashemi and F. R. Kschischang, Tanner graphs for group block codes and lattices: Construction and complexity

IEEE Trans. Info. Theory, vol. 47, pp. 822–834, Feb. 2001. doi: 10.1109/18.910592

[J101] B. J. Frey, R. Koetter, G. D. Forney Jr., F. R. Kschischang, R. J. McEliece, and D. A. Spielman, Introduction to the special issue on codes graphs and iterative algorithms

IEEE Trans. Info. Theory, vol. 47, pp. 493–497, Feb. 2001. doi: 10.1109/TIT.2001.910571

[J102] G. D. Forney Jr., F. R. Kschischang, B. Marcus, and S. Tuncel, Iterative decoding of tail-biting trellises and connections with symbolic dynamics

in Codes, Systems, and Graphical Models, ser. IMA Volumes in Mathematics and its Applications, B. Marcus and J. Rosenthal, Eds., vol. 123, Springer Verlag, 2000, pp. 239–264. doi: 10.1007/978-1-4613-0165-3_13

[J103] G. D. Forney Jr., R. Koetter, F. R. Kschischang, and A. Reznik, On the effective weights of pseudocodewords for codes defined on graphs with cycles

in Codes, Systems, and Graphical Models, ser. IMA Volumes in Mathematics and its Applications, B. Marcus and J. Rosenthal, Eds., vol. 123, Springer Verlag, 2000, pp. 101–112. doi: 10.1007/978-1-4613-0165-3_5

[J104] V. Sorokine, F. R. Kschischang, and S. Pasupathy, Gallager codes for CDMA applications I: Generalizations, constructions and performance bounds

IEEE Trans. Commun., vol. 48, pp. 1660–1668, Oct. 2000. doi: 10.1109/26.871391

[J105] V. Sorokine, F. R. Kschischang, and S. Pasupathy, Gallager codes for CDMA applications II: Implementations, complexity and system capacity

IEEE Trans. Commun., vol. 48, pp. 1818–1828, Nov. 2000. doi: 10.1109/26.886472

[J106] M. Sajadieh, F. R. Kschischang, and A. Leon-Garcia, Analysis of a dual-rate transmission scheme for Gaussian broadcast channels

European Trans. Telecommun., vol. 11, pp. 161–172, Mar.–Apr. 2000. doi: 10.1002/ett.4460110204

[J107] M. Sajadieh, F. R. Kschischang, and A. Leon-Garcia, Modulation assisted unequal error protection over the fading channel

IEEE Trans. Vehicular Techn., vol. 47, pp. 900–908, Aug. 1998. doi: 10.1109/25.704843

[J108] A. M. Chan and F. R. Kschischang, A simple taboo-based soft-decision decoding algorithm for expander codes

IEEE Commun. Letters, vol. 2, pp. 183–185, Jul. 1998. doi: 10.1109/4234.703905

[J109] F. R. Kschischang and B. J. Frey, Iterative decoding of compound codes by probability propagation in graphical models

IEEE J. Selected Areas in Commun., vol. 16, pp. 219–230, Feb. 1998. doi: 10.1109/49.661110

[J110] B. J. Frey and F. R. Kschischang, Early detection and trellis splicing: Reduced-complexity soft iterative decoding

IEEE J. Selected Areas in Commun., vol. 16, pp. 153–159, Feb. 1998. doi: 10.1109/49.661104

[J111] V. Sorokine and F. R. Kschischang, A sequential decoder for linear block codes with a variable bias-term metric

IEEE Trans. Info. Theory, vol. 44, pp. 410–416, Jan. 1998. doi: 10.1109/18.651072

[J112] F. R. Kschischang, The trellis structure of maximal fixed-cost codes

IEEE Trans. Info. Theory, vol. 42, pp. 1828–1838, Nov. 1996. doi: 10.1109/18.556678

[J113] A. Vardy and F. R. Kschischang, Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis

IEEE Trans. Info. Theory, vol. 42, pp. 2027–2034, Nov. 1996. doi: 10.1109/18.556699

[J114] G. B. Horn and F. R. Kschischang, On the intractability of permuting a block code to minimize trellis complexity

IEEE Trans. Info. Theory, vol. 42, pp. 2042–2048, Nov. 1996. doi: 10.1109/18.556701

[J115] R. C.-K. Lee and F. R. Kschischang, Non-minimal trellises for linear block codes

Lecture Notes in Computer Science, vol. 1133, pp. 111–129, 1996. doi: 10.1007/BFb0025140

[J116] A. Lau and F. R. Kschischang, A sequential soft-decision decoder for Reed-Solomon codes applied to encoded PSK in Rayleigh fading channels

IEEE Trans. Vehicular Techn., vol. 45, pp. 97–104, Feb. 1996. doi: 10.1109/25.481826

[J117] F. R. Kschischang and V. Sorokine, On the trellis structure of block codes

IEEE Trans. Info. Theory, vol. 41, pp. 1924–1937, Nov. 1995. doi: 10.1109/18.476317

[J118] W.-M. Lee and F. R. Kschischang, Complexity/performance tradeoffs in multistage decoders

European Trans. Telecommun., vol. 5, pp. 665–679, Nov.–Dec. 1994.

[J119] V. Sorokine, F. R. Kschischang, and V. Durand, Trellis-based decoding of binary linear block codes

Lecture Notes in Computer Science, vol. 793, pp. 270–286, 1994. doi: 10.1007/3-540-57936-2_44

[J120] F. R. Kschischang and S. Pasupathy, Optimal shaping properties of the truncated polydisc

IEEE Trans. Info. Theory, vol. 40, pp. 892–903, May 1994. doi: 10.1109/18.335900

[J121] F. R. Kschischang and S. Pasupathy, Optimal nonuniform signaling for Gaussian channels

IEEE Trans. Info. Theory, vol. 39, pp. 913–929, May 1993. doi: 10.1109/18.256499

[J122] F. R. Kschischang and S. Pasupathy, Some ternary and quaternary codes and associated sphere packings

IEEE Trans. Info. Theory, vol. 38, pp. 227–246, Mar. 1992. doi: 10.1109/18.119683

[J123] F. R. Kschischang, P. G. de Buda, and S. Pasupathy, Block coset codes for M-ary phase shift keying

IEEE J. Selected Areas in Commun., vol. 7, pp. 900–913, Aug. 1989. doi: 10.1109/49.29613

[J124] F. R. Kschischang and M. Molle, The helical window token ring

IEEE Trans. Info. Theory, vol. 35, pp. 626–636, May 1989. doi: 10.1109/18.30985

Conference Papers

[C1] Cheng Guo, René-Jean Essiambre, Sai Kanth Dacha, Andrea Blanco-Redondo, Frank R. Kschischang, Konrad Banaszek, James D. Sandoz, John Cloonan, and Michael Vasilyev, Flexible data rate and power efficiency pulse-position-modulation communication with independent free-running clocks

in Proc. 2024 IEEE/Optica Conf. on Lasers and Electro-Optics (CLEO), Charlotte, NC, USA, May 7–9, 2024.

[C2] M. Shehadeh, F. R. Kschischang, and A. Y. Sukmadji, Generalized staircase codes with arbitrary bit degree

in Proc. Optical Fiber Commun. Conf. (OFC), San Diego, CA, Mar. 24–28, 2024.

[C3] A. Y. Sukmadji, F. R. Kschischang, and M. Shehadeh, Generalized spatially-coupled product-like codes using zipper codes with irregular degree

in Proc. 2023 IEEE Globecom Workshops, Kuala Lumpur, Malaysia, Dec. 4–8, 2023, pp. 1560–1565. doi: 10.1109/GCWkshps58843.2023.10465005

[C4] C. Guo, S. K. Dacha, R. J. Essiambre, A. Ashikhmin, A. Blanco-Redondo, F. R. Kschischang, K. Banaszek, M. Weiner, R. Kopf, I. Crawley, M. H. Idjadi, A. A. Sayem, J. Zhao, J. D. Sandoz, N. Fontaine, N. Menkart, R. Ryf, J. Cloonan, M. Vailyev, T. E. Murphy, and E. C. Burrows, Record photon information efficiency with optical clock transmission and recovery of 12.5 bits/photon after 77 dB of optical path loss

in Proc. 2023 IEEE Photonics Conference, Orlando, FL, USA, Nov. 12–16, 2023. doi: 10.1109/IPC57732.2023.10360507

[C5] R. Rafie Borujeny and F. R. Kschischang, Nonlinear interference noise of constant-composition codes

in Proc. European Conf. Optical Commun. (ECOC), Basel, Switzerland, Sep. 18–22, 2022, pp. 1–4.

[C6] A. Tasbihi and F. R. Kschischang, Nonlinear tolerance of Tukey signalling with direct detection

in Proc. European Conf. Optical Commun. (ECOC), Basel, Switzerland, Sep. 18–22, 2022, pp. 1–4.

[C7] C. Pan, Y. Hashemi, M. Barakatain, D. Chang, F. R. Kschischang, Z. Zhang, and C. Li, Low power four-dimensional multi-level coding

in Proc. European Conf. Optical Commun. (ECOC), Basel, Switzerland, Sep. 18–22, 2022, pp. 1–4.

[C8] A. Asadzadeh, M. Barakatain, J. Mitra, F. R. Kschischang, and S. C. Draper, Randomized scheduling of ADMM-LP decoding based on geometric priors

in Proc. IEEE Information Theory Workshop, Mumbai, India, Nov. 1–9, 2022, pp. 119–124. doi: 10.1109/ITW54588.2022.9965857

[C9] R. Rafie Borujeny and F. R. Kschischang, Channel matching: An adaptive technique to increase the accuracy of soft decisions

in Proc. Optical Fiber Commun. Conf. (OFC), San Francisco, CA, Jun. 6–10, 2021, pp. 1–3.

[C10] M. Shehadeh and F. R. Kschischang, Rate-diversity optimal multiblock space-time codes via sum-rank codes

in Proc. IEEE Int. Symp. on Info. Theory, (online symposium), Los Angeles, CA, Jun. 21–26, 2020, pp. 3055–3060. doi: 10.1109/ISIT44484.2020.9174329

[C11] M. Barakatain, D. Lentner, G. Böcherer, and F. R. Kschischang, Performance-complexity tradeoffs of concatenated FEC for 64-QAM MLC and BICM

in Proc. 45th European Conf. Optical Commun. (ECOC), Dublin, Ireland, Sep. 22–26, 2019, pp. 1–4. doi: 10.1049/cp.2019.0806

[C12] R. Rafie Borujeny and F. R. Kschischang, A variational signal-space distance measure for nondispersive optical fiber

in Proc. IEEE Int. Symp. on Info. Theory, Paris, France, Jul. 7–12, 2019. doi: 10.1109/ISIT.2019.8849772

[C13] A. Y. Sukmadji, U. Martı́nez-Peñas, and F. R. Kschischang, Zipper codes: Spatially-coupled product-like codes with iterative algebraic decoding

in Proc. 16th Canadian Workshop on Information Theory, McMaster University, Hamilton, ON, Jun. 2–5, 2019, pp. 1–6. doi: 10.1109/CWIT.2019.8929906

[C14] S. E. Rumsey, S. C. Draper, and F. R. Kschischang, Information storage in multilayer resistive memories

in Proc. 16th Canadian Workshop on Information Theory, McMaster University, Hamilton, ON, Jun. 2–5, 2019, pp. 1–6. doi: 10.1109/CWIT.2019.8929912

[C15] R. Rafie Borujeny and F. R. Kschischang, A bounded-noise model for nondispersive optical fiber

in Proc. 16th Canadian Workshop on Information Theory, McMaster University, Hamilton, ON, Jun. 2–5, 2019, pp. 1–5. doi: 10.1109/CWIT.2019.8929916

[C16] U. Martı́nez-Peñas and F. R. Kschischang, Reliable and secure multishot network coding using linearized reed-solomon codes

in Proc. 56th Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 2–5, 2018, pp. 702–709. doi: 10.1109/ALLERTON.2018.8635644

[C17] U. Martı́nez-Peñas and F. R. Kschischang, Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes

in Proc. 56th Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 2–5, 2018, pp. 792–799. doi: 10.1109/ALLERTON.2018.8635867

[C18] A. Tasbihi and F. R. Kschischang, Successive four-dimensional stokes-space direct detection

in Proc. Optical Fiber Commun. Conf. (OFC), San Diego, CA, Mar. 11–15, 2018, pp. 1–3.

[C19] L. M. Zhang and F. R. Kschischang, Complexity-optimized concatenated LDGM-staircase codes

in Proc. IEEE Int. Symp. on Info. Theory, Aachen, Germany, Jun. 25–30, 2017. doi: 10.1109/ISIT.2017.8006817

[C20] C. G. Blake and F. R. Kschischang, Energy complexity of polar codes

in Proc. IEEE Int. Symp. on Info. Theory, Barcelona, Spain, Jul. 10–15, 2016, pp. 810–814. doi: 10.1109/ISIT.2016.7541411

[C21] D. Truhachev, A. Karami, L. M. Zhang, and F. R. Kschischang, Decoding analysis accounting for mis-corrections for spatially-coupled split-component codes

in Proc. IEEE Int. Symp. on Info. Theory, Barcelona, Spain, Jul. 10–15, 2016. doi: 10.1109/ISIT.2016.7541674

[C22] C. Senger and F. R. Kschischang, Syndrome-based decoding of polynomial evaluation codes with Chien search

in Proc. 28th Biennial Symp. Commun., University of British Columbia—Okanagan, Kelowna, BC, May 2016, pp. 47–51.

[C23] L. M. Zhang and F. R. Kschischang, Concatenated LDGM-staircase codes for long-haul optical-transport networks

in Proc. 28th Biennial Symp. Commun., University of British Columbia—Okanagan, Kelowna, BC, May 2016, pp. 75–80.

[C24] C. G. Blake and F. R. Kschischang, Scaling rules for the energy of decoder circuits

in Proc. IEEE Int. Symp. on Info. Theory, selected for semi-plenary presentation, Hong Kong, Jun. 14–19, 2015, pp. 1437–1441. doi: 10.1109/ISIT.2015.7282693

[C25] L. M. Zhang, D. Truhachev, and F. R. Kschischang, Spatially-coupled split-component codes with bounded-distance component decoding

in Proc. IEEE Int. Symp. on Info. Theory, Hong Kong, Jun. 14–19, 2015, pp. 56–60. doi: 10.1109/ISIT.2015.7282416

[C26] S. Ashrafi, C. Feng, S. Roy, and F. R. Kschischang, Slotted ALOHA with compute-and-forward

in Proc. IEEE Int. Symp. on Info. Theory, Hong Kong, Jun. 14–19, 2015, pp. 571–575. doi: 10.1109/ISIT.2015.7282519

[C27] F. Leduc-Primeau, F. R. Kschischang, and W. J. Gross, Energy optimization of LDPC decoder circuits with timing violations

in Proc. IEEE Int. Conf. Commun., London, UK, Jun. 8–12, 2015, pp. 412–417. doi: 10.1109/ICC.2015.7248356

[C28] M. I. Yousefi, G. Kramer, and F. R. Kschischang, Upper bound on the capacity of the nonlinear Schroedinger channel

in Proc. 14th Canadian Workshop on Information Theory, Memorial University, St. John’s, NL, Jul. 6–9, 2015, pp. 22–26. doi: 10.1109/CWIT.2015.7255144

[C29] C. Senger and F. R. Kschischang, A fast displacement-based Peterson decoder

in Proc. 14th Canadian Workshop on Information Theory, Memorial University, St. John’s, NL, Jul. 6–9, 2015, pp. 14–17. doi: 10.1109/CWIT.2015.7255142

[C30] S. Liu, F. Manganiello, and F. R. Kschischang, Construction and decoding of generalized skew-evaluation codes

in Proc. 14th Canadian Workshop on Information Theory, winner of the Best Student Paper Award (2nd place), Memorial University, St. John’s, NL, Jul. 6–9, 2015, pp. 9–13. doi: 10.1109/CWIT.2015.7255141

[C31] G. Kramer, M. I. Yousefi, and F. R. Kschischang, Upper bound on the capacity of a cascade of nonlinear and noisy channels

in Proc. IEEE Information Theory Workshop, Jerusalem, Israel, Apr. 26–May 1, 2015, pp. 1–4. doi: 10.1109/ITW.2015.7133167

[C32] S. Hari, F. R. Kschischang, and M. I. Yousefi, Multi-eigenvalue communication via the nonlinear Fourier transform

in Proc. 27th Biennial Symp. Commun., winner of the Best Student Paper Award (1st place), Queen’s University, Kingston, ON, May 2014, pp. 92–95. doi: 10.1109/QBSC.2014.6841191

[C33] M. I. Yousefi and F. R. Kschischang, Integrable communication channels and the nonlinear Fourier transform

in Proc. IEEE Int. Symp. on Info. Theory, winner of the Jack Keil Wolf Student Paper Award, Istanbul, Turkey, Jul. 7–12, 2013, pp. 1705–1709. doi: 10.1109/ISIT.2013.6620518

[C34] M. I. Yousefi and F. R. Kschischang, Communication over fiber-optic channels using the nonlinear Fourier transform

in Proc. IEEE Int. Symp. on Info. Theory, Istanbul, Turkey, Jul. 7–12, 2013, pp. 1710–1714. doi: 10.1109/ISIT.2013.6620519

[C35] C. Feng, R. W. Nobrega, F. R. Kschischang, and D. Silva, Communication over finite-ring matrix channels

in Proc. IEEE Int. Symp. on Info. Theory, Istanbul, Turkey, Jul. 7–12, 2013, pp. 2890–2894. doi: 10.1109/ISIT.2013.6620754

[C36] C. Blake and F. R. Kschischang, Energy of decoding algorithms

in Proc. 13th Canadian Workshop on Information Theory, Toronto, ON, Jun. 18–21, 2013, pp. 1–5. doi: 10.1109/CWIT.2013.6621582

[C37] J. Karout, G. Kramer, F. R. Kschischang, and E. Agrell, Continuous-amplitude modulation for optical wireless channels

in Proc. 2012 IEEE Photonics Society Summer Topical Meeting, Jul. 2012, pp. 167–168. doi: 10.1109/PHOSST.2012.6280801

[C38] C. Feng, D. Silva, and F. R. Kschischang, Blind compute-and-forward

in Proc. IEEE Int. Symp. on Info. Theory, Cambridge, MA, Jul. 1–6, 2012, pp. 403–407. doi: 10.1109/ISIT.2012.6284218

[C39] F. A. Monteiro and F. R. Kschischang, Trellis detection for random lattices

in Proc. 8th Int. Symp. Wireless Commun. Sys, Nov. 2011, pp. 755–759. doi: 10.1109/ISWCS.2011.6125450

[C40] C. Feng, D. Silva, and F. R. Kschischang, Lattice network coding via signal codes

in Proc. IEEE Int. Symp. on Info. Theory, St. Petersburg, Russia, Jul. 31–Aug. 5, 2011, pp. 2642–2646. doi: 10.1109/ISIT.2011.6034049

[C41] L. Zhang and F. R. Kschischang, Design of multi-edge-type LDPC codes for high-order coded modulation

in Proc. 12th Canadian Workshop on Information Theory, University of British Columbia—Okanagan, Kelowna, BC, May 17–20, 2011, pp. 5–8. doi: 10.1109/CWIT.2011.5872111

[C42] C. Feng, D. Silva, and F. R. Kschischang, Lattice network coding over finite rings

in Proc. 12th Canadian Workshop on Information Theory, University of British Columbia—Okanagan, Kelowna, BC, May 17–20, 2011, pp. 78–81. doi: 10.1109/CWIT.2011.5872128

[C43] M. I. Yousefi and F. R. Kschischang, The per-sample capacity of zero-dispersion optical fibers

in Proc. 12th Canadian Workshop on Information Theory, University of British Columbia—Okanagan, Kelowna, BC, May 17–20, 2011, pp. 98–101. doi: 10.1109/CWIT.2011.5872133

[C44] C. Feng, D. Silva, and F. R. Kschischang, Design criteria for lattice network coding

in Proc. 2011 Conf. on Information Sciences and Systems, Baltimore, MD, Mar. 2011. doi: 10.1109/CISS.2011.5766229

[C45] D. Silva and F. R. Kschischang, Universal secure error-correcting schemes for network coding

in Proc. IEEE Int. Symp. on Info. Theory, Austin, TX, Jun. 13–18, 2010, pp. 2428–2432. doi: 10.1109/ISIT.2010.5513776

[C46] M. I. Yousefi and F. R. Kschischang, A Fokker-Planck differential equation approach for the zero-dispersion optical fiber channel

in Proc. IEEE Int. Symp. on Info. Theory, Austin, TX, Jun. 13–18, 2010, pp. 206–210. doi: 10.1109/ISIT.2010.5513247

[C47] A. Khisti, D. Silva, and F. R. Kschischang, Secure-broadcast codes over linear deterministic channels

in Proc. IEEE Int. Symp. on Info. Theory, Austin, TX, Jun. 13–18, 2010, pp. 555–559. doi: 10.1109/ISIT.2010.5513521

[C48] C. Feng, D. Silva, and F. R. Kschischang, An algebraic approach to physical-layer network coding

in Proc. IEEE Int. Symp. on Info. Theory, Austin, TX, Jun. 13–18, 2010, pp. 1017–1021. doi: 10.1109/ISIT.2010.5513739

[C49] M. I. Yousefi and F. R. Kschischang, A probabilistic model for optical fiber channels with zero dispersion

in Proc. 25th Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2010, pp. 221–225. doi: 10.1109/BSC.2010.5472921

[C50] C. Pan and F. R. Kschischang, Differential polarization time coding for PolDM systems without PMD compensator

in Proc. 25th Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2010, pp. 242–245. doi: 10.1109/BSC.2010.5472930

[C51] S. Lyons and F. R. Kschischang, Two-dimensional barcodes for mobile phones

in Proc. 25th Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2010, pp. 344–347. doi: 10.1109/BSC.2010.5472949

[C52] S. Liu and F. R. Kschischang, Coding for MPPM-like systems

in Proc. 25th Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2010, pp. 365–368. doi: 10.1109/BSC.2010.5472957

[C53] F. R. Kschischang and B. P. Smith, Forward error correction (FEC) in optical communication

in Proc. 2010 Conference on Lasers and Electro-optics (CLEO), invited tutorial, May 2010. doi: 10.1364/CLEO.2010.CThDD1

[C54] D. Silva, W. Zeng, and F. R. Kschischang, Sparse network coding with overlapping classes

in Proc. 2009 Workshop on Network Coding, Theory and Applications, Lausanne, Switzerland, Jun. 2009, pp. 74–79. doi: 10.1109/NETCOD.2009.5191397

[C55] D. Silva and F. R. Kschischang, Universal weakly secure network coding

in Proc. 2009 IEEE Information Theory Workshop on Networking and Information Theory, Volos, Greece, Jun. 2009, pp. 281–285. doi: 10.1109/ITWNIT.2009.5158587

[C56] D. Silva and F. R. Kschischang, Fast encoding and decoding of Gabidulin codes

in Proc. IEEE Int. Symp. on Info. Theory, Seoul, Korea, Jun. 28–Jul. 3, 2009, pp. 2858–2862. doi: 10.1109/ISIT.2009.5205272

[C57] D. Silva and F. R. Kschischang, A key-based error control scheme for network coding

in Proc. 11th Canadian Workshop on Information Theory, University of Ottawa, Ottawa, ON, May 13–15, 2009, pp. 5–8. doi: 10.1109/CWIT.2009.5069508

[C58] A. Khaleghi and F. R. Kschischang, Projective-space codes for the injection metric

in Proc. 11th Canadian Workshop on Information Theory, University of Ottawa, Ottawa, ON, May 13–15, 2009, pp. 9–12. doi: 10.1109/CWIT.2009.5069509

[C59] B. Smith and F. R. Kschischang, Operating points for low-density parity-check codes in on-off keyed fiber-optic transmission systems

in Proc. OFC 2009, invited, San Diego, CA, Mar. 2009, pp. 1–3. doi: 10.1364/OFC.2009.OWE1

[C60] D. Silva and F. R. Kschischang, Adversarial error correction for network coding: Models and metrics

in Proc. 46th Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Sep. 24–26, 2008, pp. 1246–1253. doi: 10.1109/ALLERTON.2008.4797703

[C61] D. Silva and F. R. Kschischang, Security for wiretap networks via rank-metric codes

in Proc. IEEE Int. Symp. on Info. Theory, Toronto, Canada, Jul. 6–11, 2008, pp. 176–180. doi: 10.1109/ISIT.2008.4594971

[C62] D. Silva, F. R. Kschischang, and R. Koetter, Capacity of random network coding under a probabilistic error model

in Proc. 24th Biennial Symp. Commun., Queen’s University, Kingston, ON, Jun. 2008, pp. 9–12. doi: 10.1109/BSC.2008.4563194

[C63] G. Mitchell and F. R. Kschischang, An augmented orthogonal code design for the noncoherent mimo channel

in Proc. 24th Biennial Symp. Commun., Queen’s University, Kingston, ON, Jun. 2008, pp. 278–281. doi: 10.1109/BSC.2008.4563256

[C64] A. Darabiha, A. Chan Carusone, and F. R. Kschischang, A 3.3-Gbps bit-serial block-interlaced min-sum LDPC decoder in 0.13 µm CMOS

in Proc. IEEE Conf. Custom Integ. Circ, San Jose, CA, Sep. 2007, pp. 459–462. doi: 10.1109/CICC.2007.4405773

[C65] D. Wang, D. Silva, and F. R. Kschischang, Constricting the adversary: A broadcast transformation for network coding

in Proc. 45th Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Sep. 26–28, 2007.

[C66] D. Silva, F. R. Kschischang, and R. Koetter, A rank-metric approach to error control in random network coding

in Proc. 2007 IEEE Inform. Theory Workshop on Inform. Theory for Wireless Networks, Bergen, Norway, Jul. 2007, pp. 1–5. doi: 10.1109/ITWITWN.2007.4318069

[C67] K. Su and F. R. Kschischang, Coset-based lattice detection for MIMO systems

in Proc. IEEE Int. Symp. on Info. Theory, Nice, France, Jun. 24–29, 2007, pp. 1941–1945. doi: 10.1109/ISIT.2007.4557505

[C68] D. Silva and F. R. Kschischang, Using rank-metric codes for error correction in random network coding

in Proc. IEEE Int. Symp. on Info. Theory, Nice, France, Jun. 24–29, 2007, pp. 796–800. doi: 10.1109/ISIT.2007.4557322

[C69] R. Koetter and F. R. Kschischang, Coding for errors and erasures in random network coding

in Proc. IEEE Int. Symp. on Info. Theory, Nice, France, Jun. 24–29, 2007, pp. 791–795. doi: 10.1109/ISIT.2007.4557321

[C70] D. Silva and F. R. Kschischang, Rank-metric codes for priority encoding transmission with network coding

in Proc. 10th Canadian Workshop on Information Theory, University of Alberta, Edmonton, AB, Jun. 6–8, 2007, pp. 81–84. doi: 10.1109/CWIT.2007.375706

[C71] J. Hu, J. Dauwels, H.-A. Loeliger, and F. R. Kschischang, A general computation rule for lossy summaries/messages with examples from equalization

in Proc. 44th Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Sep. 27–29, 2006.

[C72] V. Pechenkin and F. R. Kschischang, Constrained coding for WDM systems

in Proc. European Conf. Optical Commun, Cannes, France, Sep. 2006, pp. 1–2. doi: 10.1109/ECOC.2006.4800983

[C73] A. Darabiha, A. Chan Carusone, and F. R. Kschischang, A bit-serial approximate min-sum LDPC decoder and FPGA implementation

in Proc. 2006 IEEE Int. Symp. Circuits and Syst., Kos, Greece, May 2006. doi: 10.1109/ISCAS.2006.1692544

[C74] B. Smith, F. R. Kschischang, and W. Yu, Low-density parity-check codes for discretized min-sum decoding

in Proc. 23rd Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2006, pp. 14–17. doi: 10.1109/BSC.2006.1644559

[C75] M. Good and F. R. Kschischang, Incremental redundancy via check splitting

in Proc. 23rd Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2006, pp. 55–58. doi: 10.1109/BSC.2006.1644569

[C76] V. Pechenkin and F. R. Kschischang, Ghost pulse suppression in quasi-linear optical data transmission systems via constrained coding

in Proc. 23rd Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2006, pp. 88–91. doi: 10.1109/BSC.2006.1644577

[C77] W. W. Y. Cheung and F. R. Kschischang, Cooperative content distribution using information droplets

in Proc. 23rd Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2006, pp. 149–152. doi: 10.1109/BSC.2006.1644592

[C78] V. Pechenkin and F. R. Kschischang, Higher bit rates for quasi-linear optical data transmission systems via constrained coding

in Proc. 2006 Optical Fiber Commun. Conf, Anaheim, CA, Mar. 2006. doi: 10.1109/OFC.2006.215788

[C79] W. Yu, M. Ardakani, B. Smith, and F. R. Kschischang, Complexity-optimized low-density parity-check codes

in Proc. 43rd Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Sep. 28–30, 2005.

[C80] W. Yu, M. Ardakani, B. Smith, and F. R. Kschischang, Complexity-optimized low-density parity-check codes for gallager decoding algorithm B

in Proc. IEEE Int. Symp. on Info. Theory, Adelaide, Australia, Sep. 4–9, 2005. doi: 10.1109/ISIT.2005.1523591

[C81] G.-C. Zhu, W. Yu, and F. R. Kschischang, Finite geometry low-density parity-check codes for channels with stuck-at defects

in Proc. 9th Canadian Workshop on Information Theory, McGill University, Montreal, QC, Jun. 5–8, 2005.

[C82] A. Darabiha, A. Chan Carusone, and F. R. Kschischang, Multi-Gbit/sec low-density parity-check decoders with reduced interconnect complexity

in IEEE Int. Symp. Circuits and Systems, Kobe, Japan, May 2005, pp. 5194–5197. doi: 10.1109/ISCAS.2005.1465805

[C83] M. Ardakani and F. R. Kschischang, Gear-shift decoding for algorithms with varying complexity

in Proc. IEEE Int. Conf. Commun, Seoul, Korea, May 2005, pp. 500–504. doi: 10.1109/ICC.2005.1494402

[C84] M. Ardakani, F. R. Kschischang, and W. Yu, Low-density parity-check coding for impulse noise correction on power-line channels

in Proc. 2005 Int. Symp. on Power Line Communications and its Applns, Apr. 2005, pp. 90–94. doi: 10.1109/ISPLC.2005.1430472

[C85] S. Hranilovic and F. R. Kschischang, Short-range wireless optical communication using pixelated transmitters and imaging receivers

in Proc. 2004 IEEE Int. Conf. Commun, Paris, France, Jun. 2004, pp. 891–895. doi: 10.1109/ICC.2004.1312630

[C86] S. C. Draper, B. J. Frey, and F. R. Kschischang, Efficient variable length channel coding for unknown DMCs

in Proc. IEEE Int. Symp. on Info. Theory, Chicago, IL, Jun. 27–Jul. 2, 2004, p. 379. doi: 10.1109/ISIT.2004.1365416

[C87] S. C. Draper, B. J. Frey, and F. R. Kschischang, On interacting encoders and decoders in multiuser settings

in Proc. IEEE Int. Symp. on Info. Theory, Chicago, IL, Jun. 27–Jul. 2, 2004, p. 118. doi: 10.1109/ISIT.2004.1365155

[C88] A. W. Eckford, F. R. Kschischang, and S. Pasupathy, Designing good LDPC codes for Markov-modulated channels

in Proc. IEEE Int. Symp. on Info. Theory, Chicago, IL, Jun. 27–Jul. 2, 2004, p. 373. doi: 10.1109/ISIT.2004.1365410

[C89] T. H. Chan and F. R. Kschischang, On the discreteness of the capacity-achieving probability measure of signal-dependent Gaussian channels

in Proc. IEEE Int. Symp. on Info. Theory, Chicago, IL, Jun. 27–Jul. 2, 2004, p. 347. doi: 10.1109/ISIT.2004.1365384

[C90] V. Pechenkin and F. R. Kschischang, A new coding scheme for runlength-limited channels

in Proc. 22nd Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2004.

[C91] Y. Mao and F. R. Kschischang, On the extrinsic information and graph-based APP decoding for memoryless channels

in Proc. 22nd Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2004.

[C92] S. Hranilovic and F. R. Kschischang, An indoor wireless optical mimo channel using pixelated arrays of transmitters and receivers

in Proc. 22nd Biennial Symp. Commun., Queen’s University, Kingston, ON, May 2004.

[C93] W. J. Gross, F. R. Kschischang, and P. G. Gulak, An FPGA interpolation processor for soft-decision Reed-Solomon decoding

in Proc. 12th Annual IEEE Symp. on Field-Programmable Custom Computing Machines, Napa, CA, Apr. 2004, pp. 310–311. doi: 10.1109/FCCM.2004.16

[C94] A. W. Eckford and F. R. Kschischang, Low-density parity-check codes for the Gilbert-Elliott channel

in Proc. 41st Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 1–3, 2003.

[C95] S. C. Draper, B. J. Frey, and F. R. Kschischang, Interactive decoding of a broadcast message

in Proc. 41st Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 1–3, 2003.

[C96] T. H. Chan and F. R. Kschischang, Capacity-achieving probability measure of an input-bounded optical channel with signal-dependent noise

in Proc. 41st Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 1–3, 2003.

[C97] S. Sen, S. Pasupathy, and F. R. Kschischang, Quantized feedback information for the SVD filtered MIMO-based FEC-coded DS-CDMA multiuser detection receiver

in Proc. 15th Annual Int. Conf. on Wireless Commun., Calgary, AB, Jul. 2003.

[C98] T. H. Chan, S. Hranilovic, and F. R. Kschischang, Capacity-achieving probability measure of an input-bounded vector gaussian channel

in Proc. IEEE Int. Symp. on Info. Theory, Yokohama, Japan, Jun. 29–Jul. 4, 2003, p. 371. doi: 10.1109/ISIT.2003.1228387

[C99] A. W. Eckford, F. R. Kschischang, and S. Pasupathy, On partial ordering of Markov-modulated channels under LDPC decoding

in Proc. IEEE Int. Symp. on Info. Theory, Yokohama, Japan, Jun. 29–Jul. 4, 2003, p. 295. doi: 10.1109/ISIT.2003.1228310

[C100] M. Ardakani, T. H. Chan, and F. R. Kschischang, Properties of EXIT charts for one-dimensional LDPC decoding schemes

in Proc. 8th Canadian Workshop on Information Theory, University of Waterloo, Waterloo, ON, May 18–21, 2003.

[C101] S. Sen, S. Pasupathy, and F. R. Kschischang, A precoded singular value decomposition multiuser detection receiver with quantized feedback information for DS-CDMA systems

in Proc. 8th Canadian Workshop on Information Theory, University of Waterloo, Waterloo, ON, May 18–21, 2003.

[C102] Y. Mao and F. R. Kschischang, Codes on graphs: State-syndrome realizations

in Proc. 8th Canadian Workshop on Information Theory, University of Waterloo, Waterloo, ON, May 18–21, 2003.

[C103] A. W. Eckford, F. R. Kschischang, and S. Pasupathy, Designing very good low-density parity-check codes for the Gilbert-Elliott channel

in Proc. 8th Canadian Workshop on Information Theory, University of Waterloo, Waterloo, ON, May 18–21, 2003.

[C104] T. H. Chan, S. Hranilovic, and F. R. Kschischang, On the discreteness of the capacity-achieving measure of an input-bounded vector Gaussian channel

in Proc. 8th Canadian Workshop on Information Theory, University of Waterloo, Waterloo, ON, May 18–21, 2003.

[C105] W. J. Gross, F. R. Kschischang, R. Koetter, and P. G. Gulak, A VLSI architecture for interpolation in soft-decision list decoding of Reed-solomon codes

in Proc. 2002 IEEE Workshop on Signal Processing Systems, San Diego, CA, Oct. 2002. doi: 10.1109/SIPS.2002.1049682

[C106] S. Hranilovic and F. R. Kschischang, Capacity bounds for power- and band-limited wireless infrared channels corrupted by Gaussian noise

in Proc. 40th Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 2–4, 2002.

[C107] A. W. Eckford, F. R. Kschischang, and S. Pasupathy, Characterizing the Gilbert-Elliott parameter space under LDPC decoding

in Proc. 40th Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 2–4, 2002.

[C108] Y. Mao and F. R. Kschischang, Duality in factor graphs

in Proc. 40th Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 2–4, 2002.

[C109] M. Ardakani and F. R. Kschischang, Designing irregular LPDC codes using EXIT charts based on message error rate

in Proc. IEEE Int. Symp. on Info. Theory, Lausanne, Switzerland, Jun. 30–Jul. 5, 2002, p. 454. doi: 10.1109/ISIT.2002.1023726

[C110] W. J. Gross, F. R. Kschischang, R. Koetter, and P. G. Gulak, Simulation results for algebraic soft-decision decoding of Reed-Solomon codes