| Publication | Date of Publication | Type |
|---|
Formalization of Line Search Methods by Lean
(available as arXiv preprint) | 2026-06-24 | Paper |
Optimal ternary locally repairable codes
Designs, Codes and Cryptography | 2024-08-23 | Paper |
Corrections to: ``Multichannel conflict-avoiding codes of weights three and four''
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Measure-theoretic probability. With applications to statistics, finance, and engineering
Compact Textbooks in Mathematics | 2024-03-05 | Paper |
Multichannel Conflict-Avoiding Codes of Weights Three and Four
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Fractional Repetition Codes With Optimal Reconstruction Degree
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Rack-Aware Regenerating Codes for Data Centers
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| scientific article; zbMATH DE number 6900643 (Why is no real title available?) | 2018-07-09 | Paper |
The Rate Region for Secure Distributed Storage Systems
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Proxy-Assisted Regenerating Codes With Uncoded Repair for Distributed Storage Systems
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Shift-Invariant Protocol Sequences for the Collision Channel Without Feedback
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Construction and Applications of CRT Sequences
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Cooperative Regenerating Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Linear Network Coding for Erasure Broadcast Channel With Feedback: Complexity and Algorithms
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Imperfect Secrecy in Wiretap Channel II
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Cooperative repair of multiple node failures in distributed storage systems
International Journal of Information and Coding Theory | 2017-03-27 | Paper |
| New CRT sequence sets for a collision channel without feedback | 2016-11-09 | Paper |
Optimal three-dimensional optical orthogonal codes of weight three
Designs, Codes and Cryptography | 2015-03-30 | Paper |
Optimal conflict-avoiding codes of odd length and weight three
Designs, Codes and Cryptography | 2014-06-27 | Paper |
Strongly Conflict-Avoiding Codes
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
| The zeta functions of two Garcia-Stichtenoth towers | 2011-04-28 | Paper |
A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
Designs, Codes and Cryptography | 2010-09-16 | Paper |
User-irrepressible sequences
Sequences and Their Applications – SETA 2010 | 2010-09-08 | Paper |
| Equidistribution of roots of L-function of Gold exponential sum | 2009-07-06 | Paper |
Sum Capacity of One-Sided Parallel Gaussian Interference Channels
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Stability of distributed power and signature sequence control for CDMA Systems-a game-theoretic framework
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| scientific article; zbMATH DE number 5010757 (Why is no real title available?) | 2006-03-09 | Paper |
| scientific article; zbMATH DE number 2154096 (Why is no real title available?) | 2005-04-08 | Paper |
Tight bounds for Chevalley–Warning–Ax–Katz type estimates, with improved applications
Proceedings of the London Mathematical Society | 2004-08-23 | Paper |
| scientific article; zbMATH DE number 1594310 (Why is no real title available?) | 2002-10-23 | Paper |
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
