


default search action
ISIT 2020: Los Angeles, CA, USA
- IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020. IEEE 2020, ISBN 978-1-7281-6432-8
- Rachel N. Berman, Ron M. Roth:
On the Number of Factorizations of Polynomials over Finite Fields. 1-6 - Wei Zhao, Kenneth W. Shum, Shenghao Yang:
Optimal Locally Repairable Constacyclic Codes of Prime Power Lengths. 7-12 - Renaud-Alexandre Pitaval, Yi Qin:
Grassmannian Frames in Composite Dimensions by Exponentiating Quadratic Forms. 13-18 - Julian Renner, Sven Puchinger, Antonia Wachter-Zeh, Camilla Hollanti, Ragnar Freij-Hollanti:
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power. 19-24 - Ryan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic:
Mass Error-Correction Codes for Polymer-Based Data Storage. 25-30 - Mahdi Soleymani, Hessam Mahdavifar:
Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks. 31-36 - Tuan Thanh Nguyen
, Kui Cai, Kees A. Schouhamer Immink:
Binary Subblock Energy-Constrained Codes: Knuth's Balancing and Sequence Replacement Techniques. 37-41 - Mengke Lian, Christian Häger, Henry D. Pfister:
Decoding Reed-Muller Codes Using Redundant Code Constraints. 42-47 - Shohei Satake
, Yujie Gu:
Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach. 48-53 - Sven Puchinger, Julian Renner, Johan Rosenkilde
:
Generic Decoding in the Sum-Rank Metric. 54-59 - Hikmet Yildiz, Netanel Raviv, Babak Hassibi:
Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero. 60-65 - Fatemeh Kazemi, Sascha Kurz, Emina Soljanin
:
A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes. 66-71 - Rishabh K. Iyer, Jeff A. Bilmes:
Concave Aspects of Submodular Functions. 72-77 - Nicolas Charpenay, Maël Le Treust:
Zero-Error Coding with a Generator Set of Variable-Length Words. 78-83 - Roni Con, Amir Shpilka
:
Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel. 84-89 - Ilya Vorobyev:
Optimal Multistage Group Testing Algorithm for 3 Defectives. 90-95 - Chong Shangguan, Itzhak Tamo:
Error Detection and Correction in Communication Networks. 96-101 - Aditya Potukuchi, Yihan Zhang
:
Improved efficiency for covering codes matching the sphere-covering bound. 102-107 - Duc Tu Dao
, Han Mao Kiah, Hengjia Wei:
Maximum Length of Robust Positioning Sequences. 108-113 - Jing Hao, Han Huang, Galyna V. Livshyts, Konstantin E. Tikhomirov:
Distribution of the Minimum Distance of Random Linear Codes. 114-119 - Dor Elimelech:
The Capacity of Multidimensional Permutations with Restricted Movement. 120-125 - Yonatan Yehezkeally
, Moshe Schwartz:
Uncertainty of Reconstructing Multiple Messages from Uniform-Tandem-Duplication Noise. 126-131 - Abhishek Agarwal, Olgica Milenkovic, Srilakshmi Pattabiraman, João Ribeiro
:
Group Testing with Runlength Constraints for Topological Molecular Storage. 132-137 - Gianira Nicoletta Alfarano
, Julia Lieb
, Joachim Rosenthal:
Construction of Rate (n - 1 )/n Non-Binary LDPC Convolutional Codes via Difference Triangle Sets. 138-143 - Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson:
Minimizing the alphabet size of erasure codes with restricted decoding sets. 144-149 - Steven T. Dougherty, Josep Rifà, Mercè Villanueva
:
Constructions of Nonequivalent Fp-Additive Generalised Hadamard Codes. 150-155 - Jinwen Shi, Cong Ling, Osvaldo Simeone, Jörg Kliewer:
Coded Computation Against Straggling Channel Decoders in the Cloud for Gaussian Channels. 156-161 - Shailja Agrawal, Prasad Krishnan:
Low Complexity Distributed Computing via Binary Matrices with Extension to Stragglers. 162-167 - Nicholas Woolsey, Rong-Rong Chen, Mingyue Ji:
Heterogeneous Computation Assignments in Coded Elastic Computing. 168-173 - Hoang Dau
, Ryan Gabrys, Yu-Chih Huang
, Chen Feng, Quang-Hung Luu, Eidah J. Alzahrani
, Zahir Tari
:
Optimizing the Transition Waste in Coded Elastic Computing. 174-178 - Shunsuke Horii:
Improved Computation-Communication Trade-Off for Coded Distributed Computing using Linear Dependence of Intermediate Values. 179-184 - Chien-Sheng Yang, Ramtin Pedarsani, Amir Salman Avestimehr:
Coded Computing in Unknown Environment via Online Learning. 185-190 - Quang Minh Nguyen, Haewon Jeong
, Pulkit Grover
:
Coded QR Decomposition. 191-196 - Adarsh M. Subramaniam, Anoosheh Heidarzadeh, Asit Kumar Pradhan, Krishna R. Narayanan:
Product Lagrange Coded Computing. 197-202 - Songze Li, Mingchao Yu, Chien-Sheng Yang, Amir Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously. 203-208 - Yu Ye, Hao Chen
, Ming Xiao
, Mikael Skoglund, H. Vincent Poor
:
Incremental ADMM with Privacy-Preservation for Decentralized Consensus Optimization. 209-214 - Kuikui Li, Meixia Tao, Jingjing Zhang, Osvaldo Simeone:
Multi-Cell Mobile Edge Coded Computing: Trading Communication and Computing for Distributed Matrix Multiplication. 215-220 - Xian Su
, Xiaomei Zhong, Xiaodi Fan, Jun Li
:
Local Re-encoding for Coded Matrix Multiplication. 221-226 - Zhen Chen, Zhuqing Jia, Zhiying Wang
, Syed Ali Jafar:
GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication. 227-232 - Pedro Soto
, Jun Li
:
Straggler-free Coding for Concurrent Matrix Multiplications. 233-238 - Asit Kumar Pradhan, Anoosheh Heidarzadeh, Krishna R. Narayanan:
Factored LT and Factored Raptor Codes for Large-Scale Distributed Matrix Multiplication. 239-244 - Qian Yu, Amir Salman Avestimehr:
Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier. 245-250 - Burak Hasircioglu
, Jesús Gómez-Vilardebó
, Deniz Gündüz
:
Bivariate Polynomial Coding for Straggler Exploitation with Heterogeneous Workers. 251-256 - Pei Peng, Emina Soljanin
, Philip Whiting:
Diversity vs. Parallelism in Distributed Computing with Redundancy. 257-262 - Andrew Thangaraj, Henry D. Pfister:
Efficient Maximum-Likelihood Decoding of Reed-Muller RM(m-3, m) Codes. 263-268 - Zilong Wang, Erzhong Xue, Guang Gong:
A New Construction of QAM Golay Complementary Sequence Pair. 269-273 - Cheuk Ting Leung, Mehul Motani, Rajshekhar Vishweshwar Bhat:
Multi-Label and Concatenated Neural Block Decoders. 274-279 - Hajir Roozbehani, Yury Polyanskiy:
Graceful degradation over the BEC via non-linear codes. 280-285 - Li Peng:
Time-Frequency Division Multiple Access and the TFDMA Ad Hoc Network Based on the (n, n(n-1), n-1) Permutation Group Codes. 286-291 - Hengjie Yang
, Linfang Wang, Vincent Lau, Richard D. Wesel:
An Efficient Algorithm for Designing Optimal CRCs for Tail-Biting Convolutional Codes. 292-297 - Jiongyue Xing, Li Chen, Martin Bossert:
Low-Complexity Chase Decoding of Reed-Solomon Codes through Basis Reduction. 298-302 - Suihua Cai, Xiao Ma:
Twisted-Pair Superposition Transmission for Low Latency Communications. 303-308 - Arnaud Dumenil, Elie Awwad
, Cyril Measson:
Tetrahedral Coding and Non-Unitary Resilience in Polarization-Multiplexed Lightwave Transmissions. 309-314 - Alejandro Cohen, Amit Solomon, Ken R. Duffy
, Muriel Médard:
Noise Recycling. 315-320 - Tomer Raviv, Nir Raviv, Yair Be'ery
:
Data-Driven Ensembles for Deep and Hard-Decision Hybrid Decoding. 321-326 - Marco Ferrari
, Ramon Marenzi, Luca Barletta:
Message Flow Analysis in Practical LDPC Decoders for the Interpretation of Absorbing Set Thresholds. 327-332 - Jiongyue Xing, Martin Bossert, Sebastian Bitzer, Li Chen:
Iterative Decoding of Non-Binary Cyclic Codes Using Minimum-Weight Dual Codewords. 333-337 - Andreas Buchberger, Christian Häger, Henry D. Pfister, Laurent Schmalen, Alexandre Graell i Amat:
Pruning Neural Belief Propagation Decoders. 338-342 - Sundara Rajan Srinivasavaradhan, Suhas N. Diggavi, Christina Fragouli:
Equivalence of ML decoding to a continuous optimization problem. 343-348 - Viduranga Bandara Wijekoon, Emanuele Viterbo, Yi Hong
:
A Low Complexity Decoding Algorithm for NB-LDPC Codes over Quadratic Extension Fields. 349-354 - Emna Ben Yacoub, Gianluigi Liva:
Asymptotic Absorbing Set Enumerators for Non-Binary Protograph-Based LDPC Code Ensembles. 355-360 - Yuxin Liu, Michelle Effros:
Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication. 361-366 - Emily McMillon
, Allison Beemer, Christine A. Kelley:
Analysis of Absorbing Sets using Cosets and Syndromes. 367-372 - Yihan Zhang
:
List Decoding for Oblivious Arbitrarily Varying MACs: Constrained and Gaussian. 373-378 - Noga Ron-Zewi
, Mary Wootters, Gilles Zémor:
Linear-time Erasure List-decoding of Expander Codes. 379-383 - Changryoul Choi, Jechang Jeong:
Fast Soft Decision Decoding of Linear Block Codes Using Partial Syndrome Search. 384-388 - Boaz Shuval, Ido Tal:
List Decoding of Universal Polar Codes. 389-394 - Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
CRC-Aided Belief Propagation List Decoding of Polar Codes. 395-400 - Marco Mondelli, Seyyed Ali Hashemi, John M. Cioffi, Andrea Goldsmith:
Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency. 401-406 - Peter Trifonov:
Recursive Trellis Decoding Techniques of Polar Codes. 407-412 - Binghao Li, Baoming Bai, Min Zhu, Shenyang Zhou:
Improved Belief Propagation List Decoding for Polar Codes. 413-418 - Jincheng Dai, Kai Niu, Zhongwei Si:
Asynchronous Polar-Coded Modulation. 419-424 - Yunus Inan, Emre Telatar:
Finite-Level Quantization Procedures for Construction and Decoding of Polar Codes. 425-430 - Jaume del Olmo Alòs, Javier R. Fonollosa:
Polar Coding for the Wiretap Broadcast Channel with Multiple Messages. 431-436 - Mustafa Cemil Coskun, Joachim Neu, Henry D. Pfister:
Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes. 437-442 - Hanwen Yao, Arman Fazeli, Alexander Vardy:
List Decoding of Arıkan's PAC Codes. 443-448 - James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications. 449-454 - Arman Fazeli, Alexander Vardy, Hanwen Yao:
Hardness of Successive-Cancellation Decoding of Linear Codes. 455-460 - Xiaowei Wu, Min Qiu
, Jinhong Yuan:
Partially Information Coupled Duo-Binary Turbo Codes. 461-466 - Homa Esfahanizadeh, Eshed Ram, Yuval Cassuto, Lara Dolecek:
Spatially Coupled Codes with Sub-Block Locality: Joint Finite Length-Asymptotic Design Approach. 467-472 - Min Zhu, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
A Novel Design of Spatially Coupled LDPC Codes for Sliding Window Decoding. 473-478 - Muhammad Umar Farooq
, Saeedeh Moloudi, Michael Lentmaier:
Generalized LDPC Codes with Convolutional Code Constraints. 479-484 - Lev Tauz, Homa Esfahanizadeh, Lara Dolecek:
Non-Uniform Windowed Decoding For Multi-Dimensional Spatially-Coupled LDPC Codes. 485-490 - Pin-Wen Su, Yu-Chih Huang
, Shih-Chun Lin, I-Hsiang Wang, Chih-Chun Wang:
Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime. 491-496 - Elad Domanovitz, Ashish Khisti, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Streaming Erasure Codes over Multi-hop Relay Network. 497-502 - Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan
, P. Vijay Kumar:
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes. 503-508 - Michael Rudow, K. V. Rashmi:
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages. 509-514 - Jia Liu, Chaoyong Wang:
Tangential-Sphere Bound Revisited. 515-518 - Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel:
On the decoding of Barnes-Wall lattices. 519-524 - Huseyin A. Inan, Ayfer Özgür
:
Strongly Explicit and Efficiently Decodable Probabilistic Group Testing. 525-530 - Tefjol Pllaha, Olav Tirkkonen
, A. Robert Calderbank:
Reconstruction of Multi-user Binary Subspace Chirps. 531-536 - Maiara F. Bollauf
, Sueli I. R. Costa
, Ram Zamir:
Lattice Construction C⋆ from Self-Dual Codes. 537-541 - Yeow Meng Chee
, Tuvi Etzion, Han Mao Kiah, Hui Zhang:
Recovery Sets for Subspaces from a Vector Space. 542-547 - Rawad Bitar, Sidharth Jaggi:
Communication Efficient Secret Sharing in the Presence of Malicious Adversary. 548-553 - Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Minimum Storage Rack-Aware Regenerating Codes with Exact Repair and Small Sub-Packetization. 554-559 - Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Toward Optimality in Both Repair and Update via Generic MDS Code Transformation. 560-565 - Yeow Meng Chee
, Charles Joseph Colbourn, Hoang Dau
, Ryan Gabrys, Alan Chi Hung Ling, Dylan Lusi, Olgica Milenkovic:
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. 566-570 - Han Cai, Moshe Schwartz:
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes. 571-576 - Francisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi:
Access-optimal Linear MDS Convertible Codes for All Parameters. 577-582 - Talha Cihad Gulcu:
Secure Node Repair of Reed-Solomon Codes. 583-588 - Zitan Chen, Min Ye, Alexander Barg:
Repair of RS codes with optimal access and error correction. 589-594 - Weijun Fang, Bin Chen, Shu-Tao Xia, Fang-Wei Fu:
Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions. 595-599 - Weijun Fang, Bin Chen, Shu-Tao Xia, Fang-Wei Fu:
Perfect LRCs and k-Optimal LRCs. 600-604 - Rémi A. Chou
, Jörg Kliewer:
Secure Distributed Storage: Rate-Privacy Trade-Off and XOR-Based Coding Scheme. 605-610 - Jie Hao, Jun Zhang, Shu-Tao Xia, Fang-Wei Fu, Yi-Xian Yang:
Weight Distributions of q-ary Optimal Locally Repairable Codes with Locality 2, Distance 5 and Even Dimension. 611-615 - Zitan Chen, Alexander Barg:
Cyclic LRC codes with hierarchy and availability. 616-621 - Siyi Yang, Ahmed H. Hareedy
, A. Robert Calderbank, Lara Dolecek:
Topology-Aware Cooperative Data Protection in Blockchain-Based Decentralized Storage Networks. 622-627 - Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi, Antonia Wachter-Zeh:
Partial MDS Codes with Local Regeneration. 628-633 - Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev:
Lifted Reed-Solomon Codes with Application to Batch Codes. 634-639 - Prasad Krishnan, V. Lalitha, Lakshmi Natarajan:
Coded Data Rebalancing: Fundamental Limits and Constructions. 640-645 - Fatemeh Kazemi, Esmaeil Karimi, Emina Soljanin
, Alex Sprintson:
A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch Codes. 646-651 - Michelle Kleckler, Soheil Mohajer:
Secure Determinant Codes: Type-II Security. 652-657 - Sagi Marcovich, Eitan Yaakobi:
Reconstruction of Strings from their Substrings Spectrum. 658-663 - Ryan Gabrys, Han Mao Kiah, Alexander Vardy, Eitan Yaakobi, Yiwei Zhang
:
Locally Balanced Constraints. 664-669 - Lev Yohananov, Eitan Yaakobi:
Codes over Trees. 670-675 - Han Mao Kiah, Tuan Thanh Nguyen
, Eitan Yaakobi:
Coding for Sequence Reconstruction for Single Edits. 676-681 - Ron M. Roth, Paul H. Siegel:
On Parity-Preserving Variable-Length Constrained Coding. 682-687 - Ahmed H. Hareedy
, Beyza Dabak, A. Robert Calderbank:
Q-ary Asymmetric LOCO Codes: Constrained Codes Supporting Flash Evolution. 688-693 - Tuan Thanh Nguyen
, Kui Cai, Kees A. Schouhamer Immink, Han Mao Kiah:
Constrained Coding with Error Control for DNA-Based Data Storage. 694-699 - Utkarsh Gupta, Han Mao Kiah, Alexander Vardy, Hanwen Yao:
Polar Codes with Balanced Codewords. 700-705 - Renfei Bu, Jos H. Weber, Kees A. Schouhamer Immink:
Maximum Likelihood Decoding for Channels with Uniform Noise and Signal Dependent Offset. 706-710 - Siddharth Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Coding for Optimized Writing Rate in DNA Storage. 711-716 - Jin Sima, Netanel Raviv, Jehoshua Bruck:
Robust Indexing - Optimal Codes for DNA Storage. 717-722 - Andreas Lenz, Cyrus Rashtchian, Paul H. Siegel, Eitan Yaakobi:
Covering Codes for Insertions and Deletions. 723-728 - Takayuki Nozaki
:
Weight Enumerators for Number-Theoretic Codes and Cardinalities of Tenengolts' Non-binary Codes. 729-733