@inproceedings {43203,
	title = {Achievable information rates and concatenated codes for the DNA nanopore sequencing channel},
	journal = {IEEE Information Theory Workshop (ITW)},
	year = {2023},
	publisher = {IEEE},
	author = {Maarouf, Issam and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@article {43129,
	title = {CodedPaddedFL and CodedSecAgg: Straggler mitigation and secure aggregation in federated learning},
	journal = { IEEE Transactions on Communications},
	volume = {71},
	number = {April},
	year = {2023},
	pages = {2013-2027},
	publisher = {IEEE},
	author = {Schlegel, Reent and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@article {42978,
	title = {Concatenated codes for multiple reads of a DNA sequence},
	journal = { IEEE Transactions on Information Theory },
	volume = {69},
	number = {February},
	year = {2023},
	month = {02/2023},
	pages = {910-927},
	publisher = {IEEE},
	author = {Maarouf, Issam and Lenz, Andreas and Welter, Lorenz and Wachter-Zeh, Antonia and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@inproceedings {43205,
	title = {Differentially-private collaborative online personalized mean estimation},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2023},
	publisher = {IEEE},
	author = {Yakimenka, Yauhen and Weng, Chung-Wei and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@article {42977,
	title = {DSAG: A mixed synchronous-asynchronous iterative method for straggler-resilient learning},
	journal = {IEEE Transactions on Communications},
	volume = {71},
	number = {February},
	year = {2023},
	pages = {808-822},
	publisher = {IEEE},
	author = {Severinson, Albin and Rosnes, Eirik and Salim El {Rouayheb} and Alexandre Graell i {Amat}}
}
@inproceedings {43207,
	title = {Efficient interpolation-based decoding of Reed-Solomon codes},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2023},
	publisher = { IEEE},
	author = {Kadir, Wrya and Lin, Hsuan-Yin and Rosnes, Eirik}
}
@inproceedings {43317,
	title = {Finite blocklength performance bound for the DNA storage channel},
	journal = {12th International Symposium on Topics in Coding (ISTC)},
	year = {2023},
	publisher = { IEEE},
	author = {Maarouf, Issam and Liva, Gianluigi and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@inproceedings {43204,
	title = {Index-based concatenated codes for the multi-draw DNA storage channel},
	journal = {IEEE Information Theory Workshop (ITW)},
	year = {2023},
	publisher = {IEEE},
	author = {Welter, Lorenz and Maarouf, Issam and Lenz, Andreas and Wachter-Zeh, Antonia and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@inproceedings {43206,
	title = {Single-server pliable private information retrieval with side information},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2023},
	publisher = { IEEE},
	author = {Obead, Sarah and Lin, Hsuan-Yin and Rosnes, Eirik}
}
@inproceedings {28383,
	title = {Coding for straggler mitigation in federated learning},
	journal = {IEEE International Conference on Communications (ICC)},
	year = {2022},
	pages = {4962-4967},
	publisher = {IEEE},
	author = {Kumar, Siddhartha and Schlegel, Reent and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@inproceedings {42986,
	title = {Computational code-based privacy in coded federated learning},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2022},
	pages = {2034-2039},
	publisher = {IEEE},
	author = {Xhemrishi, Marvin and Alexandre Graell i {Amat} and Rosnes, Eirik and Wachter-Zeh, Antonia}
}
@article {42983,
	title = {Generative adversarial user privacy in lossy single-server information retrieval},
	journal = {IEEE Transactions on Information Forensics and Security},
	volume = {17},
	year = {2022},
	pages = {3495-3510},
	publisher = {IEEE},
	author = {Weng, Chung-Wei and Yakimenka, Yauhen and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@article {28337,
	title = {Multi-server weakly-private information retrieval},
	journal = {IEEE Transactions on Information Theory },
	volume = {68},
	number = {February},
	year = {2022},
	pages = {1197-1219},
	publisher = {IEEE},
	author = {Lin, Hsuan-Yin and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat} and Yaakobi, Eitan}
}
@article {28340,
	title = {Optimal rate-distortion-leakage tradeoff for single-server information retrieval},
	journal = { IEEE Journal on Selected Areas in Communications (IEEE JSAC)},
	volume = {40},
	number = {3},
	year = {2022},
	pages = {832-846},
	publisher = {IEEE},
	author = {Yakimenka, Yauhen and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@article {28338,
	title = {Privacy-preserving coded mobile edge computing for low-latency distributed inference},
	journal = { IEEE Journal on Selected Areas in Communications (IEEE JSAC)},
	volume = {40},
	number = {3},
	year = {2022},
	pages = {788-799},
	publisher = {IEEE},
	author = {Schlegel, Reent and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@article {28339,
	title = {Private linear computation for noncolluding coded databases},
	journal = { IEEE Journal on Selected Areas in Communications},
	volume = {40},
	number = {3},
	year = {2022},
	pages = {847-861},
	publisher = {IEEE},
	author = {Sarah A. {Obead} and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@article {41334,
	title = {Private polynomial function computation for noncolluding coded databases},
	journal = {IEEE Transactions on Information Forensics and Security},
	volume = {17},
	year = {2022},
	pages = {1800-1813},
	publisher = {IEEE},
	author = {Sarah A. {Obead} and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@inproceedings {42984,
	title = {Straggler-resilient differentially-private decentralized learning},
	journal = {IEEE Information Theory Workshop (ITW)},
	year = {2022},
	pages = {708-713},
	publisher = {IEEE},
	author = {Yakimenka, Yauhen and Weng, Chung-Wei and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@inproceedings {42478,
	title = {Straggler-resilient secure aggregation for federated learning},
	journal = {2022 30th European Signal Processing Conference (EUSIPCO)},
	year = {2022},
	pages = {712-716},
	publisher = { IEEE},
	author = {Schlegel, Reent and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@article {28341,
	title = {The capacity of single-server weakly-private information retrieval},
	journal = {IEEE Journal on Selected Areas in Information Theory},
	volume = {2},
	number = {1},
	year = {2021},
	pages = {415-427},
	publisher = {IEEE},
	author = {Lin, Hsuan-Yin and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat} and Yaakobi, Eitan}
}
@inproceedings {27653,
	title = {Concatenated codes for recovery from multiple reads of DNA sequences},
	journal = {IEEE Information Theory Workshop (ITW)},
	year = {2021},
	pages = {1-5},
	publisher = {IEEE},
	doi = {10.1109/ITW46852.2021.9457675},
	author = {Lenz, Andreas and Maarouf, Issam and Welter, Lorenz and Wachter-Zeh, Antonia and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@article {27611,
	title = {Dynamic coded caching in wireless networks},
	journal = { IEEE Transactions on Communications},
	volume = {69},
	year = {2021},
	pages = {2138-2147},
	publisher = {IEEE},
	doi = {10.1109/TCOMM.2020.3047621},
	author = {pedersen, jesper and Alexandre Graell i {Amat} and goseling, jasper and Br{\"a}nnstr{\"o}m, Fredrik and Andriyanova, Iryna and Rosnes, Eirik}
}
@inproceedings {28334,
	title = {Improving age-of-information in distributed vehicle tracking},
	journal = {XXXIV General Assembly Scientific Symposium (GASS) International Union Radio Science},
	year = {2021},
	publisher = { IEEE},
	author = {Severinson, Albin and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@inproceedings {28335,
	title = {Low-latency distributed inference at the network edge using rateless codes},
	journal = {17th International Symposium on Wireless Communication Systems (ISWCS)},
	year = {2021},
	publisher = {IEEE},
	author = {Frig{\r a}rd, Anton and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@inproceedings {28336,
	title = {Optimal rate-distortion-leakage tradeoff for single-server information retrieval},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2021},
	publisher = {IEEE},
	author = {Yakimenka, Yauhen and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@article {27150,
	title = {Adaptive linear programming decoding of nonbinary linear codes over prime fields},
	journal = { IEEE Transactions on Information Theory },
	volume = {66},
	number = {3},
	year = {2020},
	pages = {1281-1317},
	publisher = {IEEE},
	author = {Rosnes, Eirik and Helmling, Michael}
}
@inproceedings {27162,
	title = {On the capacity of private monomial computation},
	journal = {International Zurich Seminar on Information and Communication},
	year = {2020},
	month = {02/2020},
	pages = {31-35},
	publisher = {ETH Zurich},
	keywords = {capacity, entropy, private computation, private information retrieval},
	author = {Yakimenka, Yauhen and Lin, Hsuan-Yin and Rosnes, Eirik}
}
@inproceedings {27610,
	title = {The capacity of single-server weakly-private information retrieval},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2020},
	publisher = {IEEE},
	author = {Lin, Hsuan-Yin and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat} and Yaakobi, Eitan}
}
@misc {27616,
	title = {Coding for edge computing},
	howpublished = {Technical tutorial at the IEEE 92nd Vehicular Technology Conference (VTC-Fall), Victoria, BC, Canada (virtual)},
	year = {2020},
	publisher = { IEEE},
	author = {Alexandre Graell i {Amat} and Rosnes, Eirik and Severinson, Albin}
}
@article {27149,
	title = {Failure analysis of the interval-passing algorithm for compressed sensing},
	journal = {IEEE Transactions on Information Theory},
	volume = {66},
	number = {April},
	year = {2020},
	pages = {2466-2486},
	publisher = {IEEE},
	author = {Yakimenka, Yauhen and Rosnes, Eirik}
}
@misc {27614,
	title = {Generative adversarial user privacy in lossy single-server information retrieval},
	howpublished = {The NeurIPS Workshop on Privacy Preserving Machine Learning - PRIML and PPML Joint Edition, Vancouver, Canada (virtual)},
	year = {2020},
	author = {Weng, Chung-Wei and Yakimenka, Yauhen and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@inproceedings {27609,
	title = {Private edge computing for linear inference based on secret sharing},
	journal = {IEEE Global Communications Conference (GLOBECOM)},
	year = {2020},
	publisher = {IEEE},
	author = {Schlegel, Reent and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@article {26404,
	title = {Achieving maximum distance separable private information retrieval capacity with linear codes},
	journal = { IEEE Transactions on Information Theory },
	volume = {65},
	number = {7},
	year = {2019},
	pages = {4243-4273},
	publisher = {IEEE},
	author = {Kumar, Siddhartha and Lin, Hsuan-Yin and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@article {26390,
	title = {Block-diagonal and LT codes for distributed computing with straggling servers},
	journal = {IEEE Transactions on Communications},
	volume = {67},
	year = {2019},
	pages = {1739-1753},
	publisher = {IEEE},
	doi = {10.1109/TCOMM.2018.2877391},
	author = {Severinson, Albin and Alexandre Graell i {Amat} and Rosnes, Eirik}
}
@inproceedings {27148,
	title = {On the capacity of private nonlinear computation for replicated databases},
	journal = {IEEE Information Theory Workshop (ITW)},
	year = {2019},
	publisher = {IEEE},
	author = {Sarah A. {Obead} and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@inproceedings {27139,
	title = {Coded distributed tracking},
	journal = {IEEE Global Communications Conference (GLOBECOM)},
	year = {2019},
	publisher = { IEEE},
	author = {Severinson, Albin and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@misc {27152,
	title = {Coding for distributed computing},
	howpublished = {Waikoloa, HI, USA},
	year = {2019},
	publisher = {IEEE},
	type = {Technical tutorial at IEEE GLOBECOM},
	author = {Alexandre Graell i {Amat} and Rosnes, Eirik and Severinson, Albin}
}
@inproceedings {27140,
	title = {Improved private information retrieval for coded storage from code decomposition},
	journal = { IEEE Information Theory Workshop (ITW)},
	year = {2019},
	publisher = { IEEE},
	author = {Lin, Hsuan-Yin and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@article {26357,
	title = {LDPC codes over the BEC: Bounds and decoding algorithms},
	journal = {IEEE Transactions on Communications},
	volume = {67},
	year = {2019},
	pages = {1754-1769},
	publisher = {ACM/IEEE},
	issn = {0090-6778},
	doi = {10.1109/TCOMM.2018.2879107},
	url = {https://ieeexplore.ieee.org/document/8519768/http://xplorestaging.ieee.org/ielx7/26/5497975/08519768.pdf?arnumber=8519768},
	author = {Irina E. {Bocharova} and Boris D. {Kudryashov} and Skachek, Vitaly and Rosnes, Eirik and Ytrehus, {\O}yvind}
}
@article {27138,
	title = {Private information retrieval from a cellular network with caching at the edge},
	journal = { IEEE Transactions on Communications},
	volume = {67},
	year = {2019},
	pages = {4900-4912},
	publisher = { IEEE},
	author = {Kumar, Siddhartha and Alexandre Graell i {Amat} and Rosnes, Eirik and Senigagliesi, Linda}
}
@inproceedings {27147,
	title = {Private information retrieval in wireless coded caching},
	journal = {IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)},
	year = {2019},
	publisher = {IEEE},
	author = {Kumar, Siddhartha and Alexandre Graell i {Amat} and Rosnes, Eirik}
}
@inproceedings {27142,
	title = {Private polynomial computation for noncolluding coded databases},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2019},
	pages = {1677-1681},
	publisher = {IEEE},
	author = {Sarah A. {Obead} and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@inproceedings {27146,
	title = {Weakly-private information retrieval},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2019},
	pages = {1257-1261},
	publisher = {IEEE},
	author = {Lin, Hsuan-Yin and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat} and Yaakobi, Eitan}
}
@inproceedings {26372,
	title = {Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage},
	journal = {IEEE Information Theory Workshop (ITW)},
	year = {2018},
	publisher = {IEEE},
	address = {Guangzhou, China},
	doi = {10.1109/ITW.2018.8613500},
	url = {https://ieeexplore.ieee.org/document/8613500/http://xplorestaging.ieee.org/ielx7/8598908/8613300/08613500.pdf?arnumber=8613500},
	author = {Lin, Hsuan-Yin and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@article {26387,
	title = {Asymptotic analysis and spatial coupling of counter braids},
	journal = { IEEE Transactions on Information Theory },
	volume = {64},
	year = {2018},
	pages = {7242-7263},
	publisher = {IEEE},
	author = {Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@inproceedings {26401,
	title = {Capacity of Private Linear Computation for Coded Databases},
	journal = {56th Annual Allerton Conference on Communication, Control, and Computing},
	year = {2018},
	pages = {813-820},
	publisher = {IEEE},
	doi = {10.1109/ALLERTON.2018.8636039},
	author = {Sarah A. {Obead} and Lin, Hsuan-Yin and Rosnes, Eirik and Kliewer, Joerg}
}
@article {26374,
	title = {Code Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity},
	journal = {IEEE Transactions on Communications},
	volume = {66},
	year = {2018},
	month = {Jan-12-2018},
	pages = {5847-5860},
	publisher = {IEEE},
	issn = {0090-6778},
	doi = {10.1109/TCOMM.2018.2858765},
	url = {https://ieeexplore.ieee.org/document/8418386/http://xplorestaging.ieee.org/ielx7/26/8576802/08418386.pdf?arnumber=8418386},
	author = {Kumar, Siddhartha and Alexandre Graell i {Amat} and Andriyanova, Iryna and Br{\"a}nnstr{\"o}m, Fredrik and Rosnes, Eirik}
}
@inproceedings {26389,
	title = {Construction D{\textquoteright} lattices from quasi-cyclic low-density parity-check codes},
	journal = {2018 IEEE 10th International Symposium on Turbo Codes Iterative Information Processing (ISTC)},
	year = {2018},
	pages = {1-5},
	publisher = {IEEE},
	doi = {10.1109/ISTC.2018.8625376},
	author = {Chen, Siyu and Brian M. {Kurkoski} and Rosnes, Eirik}
}
@inproceedings {26388,
	title = {A Droplet Approach Based on Raptor Codes for Distributed Computing With Straggling Servers},
	journal = {2018 IEEE 10th International Symposium on Turbo Codes Iterative Information Processing (ISTC)},
	year = {2018},
	pages = {1-5},
	publisher = {IEEE},
	doi = {10.1109/ISTC.2018.8625292},
	author = {Severinson, Albin and Alexandre Graell i {Amat} and Rosnes, Eirik and L{\'a}zaro, Francisco and Liva, Ginaluigi}
}
@inproceedings {26400,
	title = {Lengthening and extending binary private information retrieval codes},
	journal = {International Zurich Seminar on Information and Communication},
	year = {2018},
	publisher = {ETH},
	address = {Z{\"u}rich},
	author = {Lin, Hsuan-Yin and Rosnes, Eirik}
}
@inproceedings {26373,
	title = {Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes},
	journal = {IEEE Information Theory Workshop (ITW)},
	year = {2018},
	publisher = {IEEE},
	address = {Guangzhou, China},
	doi = {10.1109/ITW.2018.8613503},
	url = {https://ieeexplore.ieee.org/document/8613503/http://xplorestaging.ieee.org/ielx7/8598908/8613300/08613503.pdf?arnumber=8613503},
	author = {Kumar, Siddhartha and Lin, Hsuan-Yin and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@inproceedings {26371,
	title = {An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2018},
	publisher = {IEEE},
	address = {Vail, CO, USA},
	doi = {10.1109/ISIT.2018.8437804},
	url = {https://ieeexplore.ieee.org/document/8437804/http://xplorestaging.ieee.org/ielx7/8410646/8437120/08437804.pdf?arnumber=8437804},
	author = {Lin, Hsuan-Yin and Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@inproceedings {26402,
	title = {Block-diagonal coding for distributed computing with straggling servers},
	journal = {IEEE Inf. Theory Workshop (ITW)},
	year = {2017},
	publisher = {IEEE},
	author = {Severinson, Albin and Alexandre Graell i {Amat} and Rosnes, Eirik}
}
@inproceedings {26403,
	title = {Edge spreading design of high rate array-based SC-LDPC codes},
	journal = {IEEE Int. Symp. Inf. Theory (ISIT)},
	year = {2017},
	pages = {2940-2944},
	publisher = {IEEE},
	author = {David G. M. {Mitchell} and Rosnes, Eirik}
}
@inproceedings {25236,
	title = {Private Information Retrieval in Distributed Storage Systems Using an Arbitrary Linear Code},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2017},
	month = {06/2017},
	publisher = {IEEE},
	keywords = {Data Storage, Security},
	isbn = {978-1-5090-4096-4},
	issn = {2157-8117},
	doi = {10.1109/ISIT.2017.8006763},
	url = {https://arxiv.org/abs/1612.07084},
	author = {Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat}},
	editor = {Kramer, Gerhard and Mathar, Rudolf}
}
@inproceedings {25105,
	title = {On adaptive linear programming decoding of linear codes over GF(8)},
	journal = {Inf. Theory Appl. (ITA)},
	year = {2016},
	month = {02/2016},
	publisher = {IEEE Press},
	abstract = {In this work, we consider adaptive linear programming (LP) decoding of linear codes over GF(8). In particular, we give explicit constructions of valid inequalities (using no auxiliary variables) for the codeword polytope (or the convex hull) of the so-called constant-weight embedding of a single parity-check code over GF(8) that all are facet-defining. We conjecture that these inequalities together with so-called simplex constraints give a complete and irredundant description of the embedded (under the constant-weight embedding) codeword polytope. Furthermore, these sets of inequalities are used to develop an efficient (as compared to a static approach) exact (assuming that the conjecture is true) adaptive LP decoder for linear codes over GF(8). Numerical results show that only a very small subset of these inequalities is necessary for achieving close-to-exact LP decoding performance.},
	author = {Rosnes, Eirik and Helmling, Michael}
}
@inproceedings {25100,
	title = {On adaptive linear programming decoding of nonbinary linear codes over prime fields},
	journal = {9th Int. Symp. Turbo Codes \& Iterative Inf. Processing (ISTC)},
	year = {2016},
	month = {09/2016},
	pages = {106-110},
	publisher = {IEEE Press},
	abstract = {In this work, we study linear programming (LP) decoding of nonbinary linear codes over prime fields. In particular, we develop a novel separation algorithm for valid inequalities describing the codeword polytope of the so-called constant-weight embedding of a single parity-check (SPC) code over any prime field. The algorithm has linear (in the length of the SPC code) complexity, is structurally different from the one for binary codes, and is based on the principle of dynamic programming. Furthermore, it is the basis of the proposed efficient (relaxed) adaptive LP (ALP) decoder for general (non-SPC) linear codes over any prime field, generalizing the well-known ALP decoding algorithm for binary codes. Numerical results show that the ALP decoding algorithm is very efficient compared to a static approach.},
	author = {Rosnes, Eirik and Helmling, Michael}
}
@inproceedings {25104,
	title = {Constructing valid convex hull inequalities for single parity-check codes over prime fields},
	journal = {IEEE International Symposium on Information Theory (ISIT)},
	year = {2016},
	month = {07/2016},
	pages = {1939-1943},
	publisher = {IEEE Press},
	abstract = {In this work, we present an explicit construction of valid inequalities (using no auxiliary variables) for the convex hull of the so-called constant-weight embedding of a single parity-check (SPC) code over any prime field. The construction is based on classes of building blocks that are assembled to form the left-hand side of an inequality according to several rules. In the case of almost doubly-symmetric valid classes we prove that the resulting inequalities are all facet-defining, while we conjecture this to be true if and only if the class is valid and symmetric. Such sets of inequalities have not appeared in the literature before, have a strong theoretical interest, and can be used to develop an efficient (relaxed) adaptive linear programming decoder for general (non-SPC) linear codes over prime fields.},
	author = {Rosnes, Eirik and Helmling, Michael}
}
@inproceedings {25102,
	title = {On failing sets of the interval-passing algorithm for compressed sensing},
	journal = {54th Annual Allerton Conf. Commun., Control, and Computing},
	year = {2016},
	month = {09/2016},
	publisher = {IEEE Press},
	abstract = {In this work, we analyze the failing sets of the interval-passing algorithm (IPA) for compressed sensing. The IPA is an efficient iterative algorithm for reconstructing a k-sparse nonnegative n-dimensional real signal x from a small number of linear measurements y. In particular, we show that the IPA fails to recover x from y if and only if it fails to recover a corresponding binary vector of the same support, and also that only positions of nonzero values in the measurement matrix are of importance for success of recovery. Based on this observation, we introduce termatiko sets and show that the IPA fails to fully recover x if and only if the support of x contains a nonempty termatiko set, thus giving a complete (graph-theoretic) description of the failing sets of the IPA. Finally, we present an extensive numerical study showing that in many cases there exist termatiko sets of size strictly smaller than the stopping distance of the binary measurement matrix; even as low as half the stopping distance in some cases.},
	author = {Yakimenka, Yauhen and Rosnes, Eirik}
}
@article {25107,
	title = {Secure repairable Fountain codes},
	journal = {IEEE Communications Letters},
	volume = {20},
	year = {2016},
	month = {05/2016},
	pages = {1491-1494},
	publisher = {IEEE Press},
	abstract = {In this letter, we provide the construction of repairable fountain codes (RFCs) for distributed storage systems that are information-theoretically secure against an eavesdropper that has access to the data stored in a subset of the storage nodes and the data downloaded to repair an additional subset of storage nodes. The security is achieved by adding random symbols to the message, which is then encoded by the concatenation of a Gabidulin code and an RFC. We compare the achievable code rates of the proposed codes with those of secure minimum storage regenerating codes and secure locally repairable codes.},
	issn = {1089-7798},
	doi = {10.1109/LCOMM.2016.2574355},
	url = {http://ieeexplore.ieee.org/document/7480857/},
	author = {Kumar, Siddhartha and Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@inproceedings {25106,
	title = {Spatially-coupled LDPC coding in threshold-based lossy forwarding scheme},
	journal = {84th IEEE Vehicular Technology (VTC) Falls Conference},
	year = {2016},
	month = {09/2016},
	abstract = {In this work, we propose a new technique of spatially-coupled low-density parity-check coding within a threshold-based lossy forwarding protocol for a multiple access relaying system. Here, block Rayleigh fading is assumed for all transmission links and error-free decoding at the relay is not required. Two schemes are presented in which the relay computes log-likelihood ratios (LLRs) of the network-coded symbols (from the sources) based on the received signals. By comparing the LLRs to a preset threshold, the relay decides to forward hard decisions when the network-coded symbol reliability is higher than the preset threshold. Otherwise, the relay decides to stay silent (first scheme) or to forward the LLRs to the destination (second scheme). Finally, we modify the LLR combining at the destination, based on an expression for the uncoded bit-error probability which is tailored to the proposed schemes. Simulation results demonstrate that the proposed relay protocol yields an improved bit-error rate performance compared to competitive schemes proposed in the literature.},
	author = {D. N. K. {Jayakody} and Rosnes, Eirik}
}
@inproceedings {25103,
	title = {Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC},
	journal = {2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC 2016)},
	year = {2016},
	month = {09/2016},
	pages = {16-20},
	publisher = {IEEE Press},
	abstract = {A novel method of low-complexity near-maximum-likelihood (ML) decoding of quasi-cyclic (QC) low-density parity-check (LDPC) codes over the binary erasure channel is presented. The idea is similar to wrap-around decoding of tail-biting convolutional codes. ML decoding is applied to a relatively short window which is cyclically shifted along the received sequence. The procedure is repeated until either all erasures have been corrected, or no new erasures are corrected at a certain round. A new upper bound on the ensemble-average ML decoding error probability for a finite-length row-regular LDPC code family is derived and presented. Furthermore, a few examples of regular and irregular QC LDPC codes are studied by simulations and their performance is compared with the ensemble-average performance. Finally, the impact of the codeword weight and stopping set size spectra on the ML and belief-propagation decoding performance is discussed.},
	author = {Irina E. {Bocharova} and Boris D. {Kudryashov} and Rosnes, Eirik and Skachek, Vitaly and Ytrehus, {\O}yvind}
}
@inproceedings {23492,
	title = {On adaptive linear programming decoding of ternary linear codes},
	journal = {IEEE Information Theory Workshop},
	year = {2015},
	month = {05/2015},
	publisher = {IEEE Press},
	author = {Rosnes, Eirik and Helmling, Michael}
}
@inproceedings {23508,
	title = {Analysis of spatially-coupled counter braids},
	journal = {IEEE Information Theory Workshop},
	year = {2015},
	month = {10/2015},
	publisher = {IEEE Press},
	author = {Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@misc {23507,
	title = {On the analysis of spatially-coupled counter braids},
	howpublished = {La Jolla, CA, USA},
	year = {2015},
	type = {Invited talk at the 2015 Information Theory and Applications Workshop},
	author = {Rosnes, Eirik and Alexandre Graell i {Amat}}
}
@misc {23506,
	title = {On maximum-likelihood decoding of polar codes},
	howpublished = {Jerusalem, Israel},
	year = {2015},
	type = {Invited talk at the 2015 IEEE Information Theory Workshop},
	author = {Helmling, Michael and Rosnes, Eirik and Ruzika, Stefan}
}
@inproceedings {23502,
	title = {On the minimum distance of array-based spatially coupled low-density parity-check codes},
	journal = {IEEE International Symposium on Information Theory},
	year = {2015},
	month = {06/2015},
	publisher = {IEEE Press},
	author = {Rosnes, Eirik}
}
@inproceedings {23504,
	title = {Efficient maximum-likelihood decoding of linear block codes on binary memoryless channels},
	journal = {IEEE International Symposium on Information Theory},
	year = {2014},
	month = {07/2014},
	pages = {2589-2593},
	publisher = {IEEE Press},
	author = {Helmling, Michael and Rosnes, Eirik and Ruzika, Stefan and Scholl, Stefan}
}
@article {23499,
	title = {Minimum pseudoweight analysis of 3-dimensional turbo codes},
	journal = {IEEE Transactions on Communications},
	volume = {62},
	year = {2014},
	month = {07/2014},
	pages = {2170-2182},
	publisher = {IEEE Press},
	author = {Rosnes, Eirik and Helmling, Michael and Alexandre Graell i {Amat}}
}
@article {23498,
	title = {On the minimum/stopping distance of array low-density parity-check codes},
	journal = {IEEE Transactions on Information Theory},
	volume = {60},
	year = {2014},
	month = {09/2014},
	pages = {5204-5214},
	publisher = {IEEE Press},
	author = {Rosnes, Eirik and Marcel Adrian {Ambroze} and Tomlinson, Martin}
}
@article {23501,
	title = {Near-field passive RFID communication: Channel model and code design},
	journal = {IEEE Transactions on Communications},
	volume = {62},
	year = {2014},
	month = {05/2014},
	pages = {1716-1727},
	publisher = {IEEE Press},
	author = {Barbero, {\'A}ngela and Rosnes, Eirik and Yang, Guang and Ytrehus, {\O}yvind}
}
@inproceedings {23503,
	title = {Spatially-coupled counter braids},
	journal = {IEEE Information Theory Workshop},
	year = {2014},
	month = {11/2014},
	pages = {188-192},
	publisher = {IEEE Press},
	author = {Rosnes, Eirik}
}
@inproceedings {23505,
	title = {An upper bound on the minimum distance of array low-density parity-check codes},
	journal = {IEEE International Symposium on Information Theory},
	year = {2014},
	month = {07/2014},
	pages = {3155-3159},
	author = {Rosnes, Eirik and Marcel Adrian {Ambroze} and Tomlinson, Martin}
}
@article {23500,
	title = {Using short synchronous WOM codes to make WOM codes decodable},
	journal = {IEEE Transactions on Communications},
	volume = {62},
	year = {2014},
	month = {07/2014},
	pages = {2156-2169},
	publisher = {IEEE Press},
	author = {Bitouz{\'e}, Nicolas and Alexandre Graell i {Amat} and Rosnes, Eirik}
}
