More Like this

1. A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch Codes

   https://doi.org/10.1109/ISIT44484.2020.9174027  

   Kazemi, Fatemeh ; Karimi, Esmaeil ; Soljanin, Emina ; Sprintson, Alex ( June 2020 , 2020 IEEE International Symposium on Information Theory (ISIT'20))

   null (Ed.)
2. Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes

   https://doi.org/10.1007/s10623-020-00726-x  

   López, Hiram H. ; Matthews, Gretchen L. ; Soprunov, Ivan ( January 2020 , Designs, Codes and Cryptography)
3. Improving Service Performance through Multilayer Routing and Service Intelligence in a Network Service Mesh

   https://doi.org/10.1109/ANTS52808.2021.9936995  

   Hu, Boyang ; Nadig, Deepak ; Ramamurthy, Byrav ( December 2021 , 2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS))

   Network service mesh architectures, by interconnecting cloud clusters, provide access to services across distributed infrastructures. Typically, services are replicated across clusters to ensure resilience. However, end-to-end service performance varies mainly depending on the service loads experienced by individual clusters. Therefore, a key challenge is to optimize end-to-end service performance by routing service requests to clusters with the least service processing/response times. We present a two-phase approach that combines an optimized multi-layer optical routing system with service mesh performance costs to improve end-to-end service performance. Our experimental strategy shows that leveraging a multi-layer architecture in combination with service performance information improves end-to-end performance. We evaluate our approach by testing our strategy on a service mesh layer overlay on a modified continental united states (CONUS) network topology. 

   more » « less
4. Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels

   https://doi.org/10.1109/ITW.2018.8613428  

   Fazeli, Arman ; Hassani, Hamed ; Mondelli, Marco ; Vardy, Alexander ( November 2018 , Proceedings of the IEEE Information Theory Workshop (ITW))
5. Q-ary Asymmetric LOCO Codes: Constrained Codes Supporting Flash Evolution

   https://doi.org/10.1109/ISIT44484.2020.9174176  

   Hareedy, Ahmed ; Dabak, Beyza ; Calderbank, Robert ( June 2020 , IEEE International Symposium on Information Theory (ISIT 2020))

   Flash memory devices are winning the competition for storage density against magnetic recording devices. This outcome results from advances in physics that allow storage of more than one bit per cell, coupled with advances in signal processing that reduce the effect of physical instabilities. Constrained codes are used in storage to avoid problematic patterns. Recently, we introduced binary symmetric lexicographically-ordered constrained codes (LOCO codes) for data storage and transmission. This paper introduces simple constrained codes that support non-binary physical gates in multi, triple, quad, and the currently-in-development penta-level cell (M/T/Q/P-LC) Flash memories. The new codes can be easily modified if problematic patterns change with time. These codes are designed to mitigate inter-cell interference, which is a critical source of error in Flash devices. The new codes are called q-ary asymmetric LOCO codes (QA-LOCO codes), and the construction subsumes codes previously designed for single-level cell (SLC) Flash devices (ALOCO codes). QA-LOCO codes work for a Flash device with any number, q, of levels per cell. For q ≥ 4, we show that QA-LOCO codes can achieve rates greater than 0.95log 2 q information bits per coded symbol. Capacity-achieving rates, affordable encoding-decoding complexity, and ease of reconfigurability support the growing improvement of M/T/Q/P-LC Flash memory devices, as well as lifecycle management as the characteristics of these devices change with time. 

   more » « less