Results 211 to 220 of about 63,628 (226)

Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6

IEEE Transactions on Information Theory, 2021
Weijun Fang, Shu-Tao Xia, Jie Hao
exaly  

An Improved Bound and Singleton-Optimal Constructions of Fractional Repetition Codes

IEEE Transactions on Communications, 2022
Bing Zhu, Kenneth W Shum, Jianxin Wang
exaly  

On Lengths of Singleton-Optimal Locally Repairable Codes

IEEE Transactions on Communications, 2023
Shu Liu, Ting-Yi Wu, Chaoping Xing
exaly  

Improving the Singleton-Type Upper Bounds for Non-Linear Deletion Correcting Codes

2024 IEEE International Symposium on Information Theory (ISIT)
Shiqin Liu, Chen Wang 0134, Gennian Ge, Yiwei Zhang 0018   +3 more
openaire   +1 more source

On subsystem codes beating the quantum Hamming or Singleton bound

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2007
Andreas Klappenecker, Pradeep Kiran Sarvepalli   +1 more
exaly  

Strong Singleton type upper bounds for linear insertion-deletion codes.

CoRR, 2021
openaire   +1 more source

Improved Singleton-type Bounds for Locally Repairable Codes.

CoRR, 2016
Antti Pöllänen, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti   +3 more
openaire   +1 more source

Improved Singleton bound on frequency hopping sequences and optimal constructions

Designs, Codes, and Cryptography, 2018

exaly  

Critical Pairs for the Product Singleton Bound

IEEE Transactions on Information Theory, 2015
Gilles Zémor
exaly  

Construction of Linear Network Codes that Achieve a Refined Singleton Bound

2007
Shenghao Yang, Raymond W Yeung
exaly