Home
Eirik Rosnes's picture

Eirik Rosnes

Guest Researcher
  • E-maileirik.rosnes@uib.no
  • Visitor Address
    HIB - Thormøhlens gate 55
    5006 Bergen
  • Postal Address
    Postboks 7803
    5020 Bergen
Academic article
  • Show author(s) (2022). Private Polynomial Function Computation for Noncolluding Coded Databases. IEEE Transactions on Information Forensics and Security. 1800-1813.
  • Show author(s) (2022). Private Linear Computation for Noncolluding Coded Databases. IEEE Journal on Selected Areas in Communications. 847-861.
  • Show author(s) (2022). Privacy-Preserving Coded Mobile Edge Computing for Low-Latency Distributed Inference. IEEE Journal on Selected Areas in Communications. 788-799.
  • Show author(s) (2022). Multi-Server Weakly-Private Information Retrieval. IEEE Transactions on Information Theory. 1197-1219.
  • Show author(s) (2021). Dynamic coded caching in wireless networks. IEEE Transactions on Communications. 2138-2147.
  • Show author(s) (2020). The Capacity of Single-Server Weakly-Private Information Retrieval. IEEE International Symposium on Information Theory. Proceedings. 1053-1058.
  • Show author(s) (2020). Failure analysis of the interval-passing algorithm for compressed sensing. IEEE Transactions on Information Theory. 2466-2486.
  • Show author(s) (2020). Coded Distributed Tracking. IEEE Global Communications Conference (GLOBECOM).
  • Show author(s) (2020). Adaptive linear programming decoding of nonbinary linear codes over prime fields. IEEE Transactions on Information Theory. 1281-1317.
  • Show author(s) (2019). Weakly-Private Information Retrieval. IEEE International Symposium on Information Theory. Proceedings. 1257-1261.
  • Show author(s) (2019). Private Polynomial Computation for Noncolluding Coded Databases. IEEE International Symposium on Information Theory. Proceedings. 1677-1681.
  • Show author(s) (2019). Private Information Retrieval in Wireless Coded Caching. IEEE Xplore digital library.
  • Show author(s) (2019). On the Capacity of Private Nonlinear Computation for Replicated Databases. IEEE Xplore digital library.
  • Show author(s) (2019). Local reconstruction codes: A class of MDS-PIR capacity-achieving codes. 2018 IEEE Information Theory Workshop (ITW). 1-5.
  • Show author(s) (2019). Improved Private Information Retrieval for Coded Storage from Code Decomposition : (Invited Paper). IEEE Xplore digital library.
  • Show author(s) (2019). Capacity of Private Linear Computation for Coded Databases. 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton). 813-820.
  • Show author(s) (2019). Block-Diagonal and LT Codes for Distributed Computing with Straggling Servers. IEEE Transactions on Communications. 1739-1753.
  • Show author(s) (2019). Asymmetry helps: Improved private information retrieval protocols for distributed storage. IEEE Xplore digital library.
  • Show author(s) (2019). Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes. IEEE Transactions on Information Theory. 4243-4273.
  • Show author(s) (2018). LDPC Codes Over the BEC: Bounds and Decoding Algorithms. IEEE Transactions on Communications. 1754-1769.
  • Show author(s) (2018). Code Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity. IEEE Transactions on Communications. 5847-5860.
  • Show author(s) (2018). Block-diagonal coding for distributed computing with straggling servers. IEEE International Symposium on Information Theory. Proceedings. 464-468.
  • Show author(s) (2018). Asymptotic Analysis and Spatial Coupling of Counter Braids. IEEE Transactions on Information Theory. 7242-7263.
  • Show author(s) (2018). An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes. IEEE International Symposium on Information Theory. Proceedings. 966-970.
  • Show author(s) (2018). A Droplet Approach Based on Raptor Codes for Distributed Computing with Straggling Servers. International Symposium on Turbo Codes and Iterative Information Processing, ISTC.
  • Show author(s) (2017). Spatially-coupled LDPC coding in threshold-based lossy forwarding scheme. IEEE Vehicular Technology Conference (VTC) Proceedings. 1-6.
  • Show author(s) (2016). Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC. International Symposium on Turbo Codes and Iterative Information Processing, ISTC. 16-20.
  • Show author(s) (2016). Secure repairable fountain codes. IEEE Communications Letters. 1491-1494.
  • Show author(s) (2016). On adaptive linear programming decoding of nonbinary linear codes over prime fields. International Symposium on Turbo Codes and Iterative Information Processing, ISTC. 106-110.
  • Show author(s) (2016). Constructing valid convex hull inequalities for single parity-check codes over prime fields. IEEE International Symposium on Information Theory. Proceedings. 1939-1943.
  • Show author(s) (2015). On the minimum distance of array-based spatially-coupled low-density parity-check codes. IEEE International Symposium on Information Theory. Proceedings. 884-888.
  • Show author(s) (2014). Using short synchronous WOM codes to make WOM codes decodable. IEEE Transactions on Communications. 2156-2169.
  • Show author(s) (2014). On the minimum/stopping distance of array low-density parity-check codes. IEEE Transactions on Information Theory. 5204-5214.
  • Show author(s) (2014). Near-field passive RFID communication: Channel model and code design. IEEE Transactions on Communications. 1716-1727.
  • Show author(s) (2014). Minimum pseudoweight analysis of 3-dimensional turbo codes. IEEE Transactions on Communications. 2170-2182.
  • Show author(s) (2012). Random edge-local complementation with applications to iterative decoding of high-density parity-check codes. IEEE Transactions on Communications. 2796-2808.
  • Show author(s) (2012). On the power transfer of error-control codes for RFID communications. IEEE International Symposium on Information Theory. Proceedings. 498-502.
  • Show author(s) (2012). On the minimum distance of turbo codes with quadratic permutation polynomial interleavers. IEEE Transactions on Information Theory. 4781-4795.
  • Show author(s) (2012). Coding for inductively coupled channels. IEEE Transactions on Information Theory. 5418-5436.
  • Show author(s) (2012). Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”. IEEE Transactions on Information Theory. 164-171.
  • Show author(s) (2011). Performance Analysis of 3-D Turbo Codes. IEEE Transactions on Information Theory. 3707-3720.
  • Show author(s) (2011). Numerical Study of Power Transfer in a Passive RFID System. AIP Conference Proceedings. 1874-1877.
  • Show author(s) (2010). Improved adaptive belief propagation decoding using edge-local complementation. IEEE International Symposium on Information Theory. Proceedings. 774-778.
  • Show author(s) (2010). Error Correcting Coding for a Nonsymmetric Ternary Channel. IEEE Transactions on Information Theory. 5715-5729.
  • Show author(s) (2010). Design of a Concatenated Coding Scheme for a Bit-Shift Channel. IEEE International Conference on Communications. 5 pages.
  • Show author(s) (2009). On the pairwise error probability of linear programming decoding on independent rayleigh flat-fading channels. IEEE Transactions on Information Theory. 2942-2955.
  • Show author(s) (2009). On Linear Programming Decoding on a Quantized Additive White Gaussian Noise Channel. Lecture Notes in Computer Science (LNCS). 22-37.
  • Show author(s) (2009). Good Concatenated Code Ensembles for the Binary Erasure Channel. IEEE Journal on Selected Areas in Communications. 928-943.
  • Show author(s) (2009). An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices. IEEE Transactions on Information Theory. 4167-4178.
  • Show author(s) (2008). Stopping set analysis of iterative row-column decoding of product codes. IEEE Transactions on Information Theory. 1551-1560.
  • Show author(s) (2008). Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation. Lecture Notes in Computer Science (LNCS). 82-94.
  • Show author(s) (2008). Adaptive Soft-Decision Decoding Using Edge Local Complementation. Lecture Notes in Computer Science (LNCS). 82-94.
  • Show author(s) (2007). Turbo decoding on the binary erasure channel: Finite-length analysis and turbo stopping sets. IEEE Transactions on Information Theory. 4059-4075.
  • Show author(s) (2006). On the design of bit-interleaved turbo-coded modulation with low error floors. IEEE Transactions on Communications. 1563-1573.
  • Show author(s) (2006). Frequency estimation of a single complex sinusoid using a generalized kay estimator. IEEE Transactions on Communications. 407-415.
  • Show author(s) (2005). Improved algorithms for the determination of turbo-code weight distributions. IEEE Transactions on Communications. 20-26.
Report
  • Show author(s) (2010). Random Edge-Local Complementation With Applications to Iterative Decoding of HDPC Codes. 395. 395. .
Academic lecture
  • Show author(s) (2010). On iterative decoding of HDPC codes using weight-bounding graph operations.
  • Show author(s) (2008). Code Design Using a 2-Level Generalized Tanner Graph on the Binary Erasure Channel.
  • Show author(s) (2008). An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices.
Editorial
  • Show author(s) (2011). Special Issue: Coding and Cryptography. Designs, Codes and Cryptography. 1-1.
Academic anthology/Conference proceedings
  • Show author(s) (2009). Preproceedings The International Workshop on Coding and Cryptography. Allkopi Bergen.
Academic chapter/article/Conference paper
  • Show author(s) (2014). Spatially-coupled counter braids. 5 pages.
  • Show author(s) (2014). Efficient maximum-likelihood decoding of linear block codes on binary memoryless channels. 5 pages.
  • Show author(s) (2014). An upper bound on the minimum distance of array low-density parity-check codes. 5 pages.
  • Show author(s) (2012). Error correction on an insertion/deletion channel applying codes from RFID standards. 6 pages.
  • Show author(s) (2011). Pseudocodewords of Linear Programming Decoding of 3-Dimensional Turbo Codes. 5 pages.
  • Show author(s) (2011). On the Minimum Distance Properties of Weighted Nonbinary Repeat Multiple-Accumulate Codes. 5 pages.
  • Show author(s) (2011). On the Capacity of a Discretized Gaussian Shift Channel. 6 pages.
  • Show author(s) (2011). Iterative Soft Decoding of Binary Linear Codes Using a Generalized Tanner Graph. 5 pages.
  • Show author(s) (2011). Constrained Codes for Passive RFID Communication. 9 pages.
  • Show author(s) (2010). Stopping Set Analysis of 3-Dimensional Turbo Code Ensembles. 5 pages.
  • Show author(s) (2010). Performance Analysis of Weighted Nonbinary Repeat Multiple-Accumulate Codes. 5 pages.
  • Show author(s) (2010). Improved adaptive belief propagation decoding using edge-local complementation. 5 pages.
  • Show author(s) (2010). Exploiting the CRC-CCITT Code on the Binary Erasure Channel. 5 pages.
  • Show author(s) (2010). Design of a Concatenated Coding Scheme for a Bit-Shift Channel. 5 pages.
  • Show author(s) (2010). Coding Challenges for Inductively Coupled Channels. 2 pages.
  • Show author(s) (2010). Analysis of 3-Dimensional Turbo Code Ensembles. 5 pages.
  • Show author(s) (2009). Stopping Set Analysis of Repeat Multiple-Accumulate Codes. 5 pages.
  • Show author(s) (2009). Iterative Decoding on Multiple Tanner Graphs Using Random Edge Local Complementation. 5 pages.
  • Show author(s) (2009). Coding for a Bit-Shift Channel With Applications to Inductively Coupled Channels. 6 pages.
  • Show author(s) (2008). Modulation Codes for Reader-Tag Communication on Inductively Coupled Channels. 6 pages.
  • Show author(s) (2008). Minimum Distance Upper Bounds for 3-Dimensional Turbo Codes Using Quadratic Permutation Polynomial Interleavers. 6 pages.
  • Show author(s) (2008). Code Design and Performance Analysis Using a 2-Level Generalized Tanner Graph on the Binary Erasure Channel. 6 pages.
  • Show author(s) (2007). On the effects of pseudo-codewords on independent Rayleigh flat-fading channels. 5 pages.
  • Show author(s) (2007). An algorithm to find all small-size stopping sets of low-density parity-check matrices. 5 pages.
  • Show author(s) (2006). Stopping sets for iterative row-column decoding of product codes. 6 pages.
  • Show author(s) (2006). Optimum distance quadratic permutation polynomial-based interleavers for turbo codes. 5 pages.
  • Show author(s) (2006). On the connection between finite graph covers, pseudo-codewords, and linear programming decoding of turbo codes. 6 pages.
  • Show author(s) (2005). Turbo stopping sets: the uniform interleaver and efficient enumeration. 5 pages.
  • Show author(s) (2005). On the construction of good families of rate-compatible punctured turbo codes. 5 pages.
  • Show author(s) (2005). Finite-length analysis of turbo decoding on the binary erasure channel. 5 pages.

More information in national current research information system (CRIStin)