4 papers
Asymptotically good CSS-T codes and a new construction of triorthogonal codes
Elena Berardini, Reza Dastbasteh, Josu Etxezarreta Martinez +2
We propose a new systematic construction of CSS-T codes from any given CSS code using a map . When is the identity map , we retrieve the construction of [1] and use it to…
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling
Shreyas Jain, V. Arvind Rameshwar, Navin Kashyap
This paper develops an algorithmic approach for obtaining estimates of the weight enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for estimating the pa…
Interactive Byzantine-Resilient Gradient Coding for General Data Assignments
Shreyas Jain, Luis Maßny, Christoph Hofmeister +2
We tackle the problem of Byzantine errors in distributed gradient descent within the Byzantine-resilient gradient coding framework. Our proposed solution can recover the exact full…
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes
V. Arvind Rameshwar, Shreyas Jain, Navin Kashyap
This paper develops an algorithmic approach for obtaining approximate, numerical estimates of the sizes of subcodes of Reed-Muller (RM) codes, all of the codewords in which satisfy…