Results 41 to 50 of about 7,804,605 (312)
MDS Array Codes with Optimal Rebuilding [PDF]
, 2011 MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fraction of the remaining information that needs to be accessed in order to
Bruck, Jehoshua +2 more
core +3 more sources
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes [PDF]
IEEE Transactions on Information Theory, 2018 Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code optimal if it achieves the Singleton-type bound).
Yuan Luo, C. Xing, Chen Yuan
semanticscholar +1 more source
On Tight Optimal Conflict-Avoiding Codes for 3, 4, 5 and 6 Active Users
Cybernetics and Information Technologies, 2018 We classify tight optimal conflict-avoiding codes of weights 3, 4, 5 and 6 and given small lengths.
Baicheva Tsonka, Topalova Svetlana
doaj +1 more source
Linear Algebra and its Applications, 2016 In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal parameters.
openaire +3 more sources
An Explicit Construction of Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures [PDF]
Information Theory Workshop, 2019 This paper presents a new construction of error correcting codes which achieves optimal recovery of a streaming source over a packet erasure channel.
Damian Dudzicz, Silas L. Fong, A. Khisti
semanticscholar +1 more source
An Embedding Strategy Using Q-Ary Convolutional Codes for Large and Small Payloads
Mathematics, 2021 Matrix embedding (ME) code is a commonly used steganography technique, which uses linear block codes to improve embedding efficiency. However, its main disadvantage is the inability to perform maximum likelihood decoding due to the high complexity of ...
Jyun-Jie Wang +4 more
doaj +1 more source
On the number of optimal index codes
2015 IEEE International Symposium on Information Theory (ISIT), 2015 In Index coding there is a single sender with multiple messages and multiple receivers each wanting a different set of messages and knowing a different set of messages a priori. The Index Coding problem is to identify the minimum number of transmissions (optimal length) to be made so that all receivers can decode their wanted messages using the ...
R. Kavitha, B. Sundar Rajan
openaire +2 more sources
Low Complexity Encoding for Network Codes [PDF]
, 2006 In this paper we consider the per-node run-time complexity of network multicast codes. We show that the randomized algebraic network code design algorithms described extensively in the literature result in codes that on average require a number of ...
Cassuto, Yuval +2 more
core +3 more sources
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2018 We study two basic problems regarding edit errors (insertions and deletions). The first one is document exchange, where two parties Alice and Bob hold two strings x and y with a bounded edit distance k.
Kuan Cheng, Zhengzhong Jin, X. Li, Ke Wu
semanticscholar +1 more source
On authentication codes based on orthogonal tables
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2014 The authentication codes resistant to messages imitation and substitution are investigated. The case when the probabilities of imitation and substitution reach the lower limits has been highlighted. Such authentication codes are called optimal.
Sergey M Ratseev, Olga I Cherevatenko
doaj +1 more source