5 results
Search Results
2. Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound.
- Author
-
Xiang, Can, Ding, Cunsheng, and Mesnager, Sihem
- Subjects
- *
BINARY codes , *MATHEMATICAL bounds , *SET theory , *HAMMING distance , *MULTIPLE access protocols (Computer network protocols) - Abstract
In this paper, a generic construction of codebooks based on binary codes is introduced. With this generic construction, a few previous constructions of optimal codebooks are extended, and a new class of codebooks almost meeting the Levenshtein bound is presented. Exponentially many codebooks meeting or almost meeting the Levenshtein bound from binary codes are obtained in this paper. The codebooks constructed in this paper have alphabet size 4. As a byproduct, three bounds on the parameters of binary codes are derived. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
3. Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes.
- Author
-
Hu, Weihua, Yamamoto, Hirosuke, and Honda, Junya
- Subjects
- *
BINARY codes , *MATHEMATICAL bounds , *ENTROPY (Information theory) , *HUFFMAN codes , *DATA compression - Abstract
Binary almost instantaneous fixed-to-variable length (AIFV) codes are lossless codes that generalize the class of instantaneous fixed-to-variable length codes. The code uses two code trees and assigns source symbols to incomplete internal nodes as well as to leaves. AIFV codes are empirically shown to attain better compression ratio than Huffman codes. Nevertheless, an upper bound on the redundancy of optimal binary AIFV codes is only known to be 1, which is the same as the bound of Huffman codes. In this paper, the upper bound is improved to 1/2, which is shown to coincide with the worst-case redundancy of the codes. Along with this, the worst-case redundancy is derived for sources with p\max \geq 1 /2, where p\max is the probability of the most likely source symbol. In addition, we propose an extension of binary AIFV codes, which use $m$ code trees and allow at most $m$ -bit decoding delay. We show that the worst-case redundancy of the extended binary AIFV codes is $1/m$ for $m \leq 4$ . [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
4. Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes.
- Author
-
Chee, Yeow Meng, Kiah, Han Mao, Zhang, Hui, and Zhang, Xiande
- Subjects
- *
CODING theory , *ERROR detection (Information theory) , *ERROR correction (Information theory) , *STATISTICAL reliability , *MATHEMATICAL bounds - Abstract
Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for the MCWCs, which yield several new infinite families of optimal MCWCs. Furthermore, we demonstrate that the Johnson-type upper bounds of the MCWCs are asymptotically tight for fixed Hamming weights and distances. Finally, we provide bounds and constructions of the 2-D MCWCs. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
5. Binary Linear Locally Repairable Codes.
- Author
-
Huang, Pengfei, Yaakobi, Eitan, Uchikawa, Hironori, and Siegel, Paul H.
- Subjects
- *
BINARY codes , *ERROR correction (Information theory) , *MATHEMATICAL bounds , *INFORMATION technology security , *DISTRIBUTED computing - Abstract
Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do not explicitly take into consideration the field size $q$ , i.e., the size of the code alphabet. In particular, for the binary case, only a few results are known. In this paper, we present an upper bound on the minimum distance $d$ of linear LRCs with availability, based on the work of Cadambe and Mazumdar. The bound takes into account the code length $n$ , dimension $k$ , locality $r$ , availability $t$ , and field size $q$ . Then, we study the binary linear LRCs in three aspects. First, we focus on analyzing the locality of some classical codes, i.e., cyclic codes and Reed–Muller codes, and their modified versions, which are obtained by applying the operations of extend, shorten, expurgate, augment, and lengthen. Next, we construct LRCs using phantom parity-check symbols and multi-level tensor product structure, respectively. Compared with other previous constructions of binary LRCs with fixed locality or minimum distance, our construction is much more flexible in terms of code parameters, and gives various families of high-rate LRCs, some of which are shown to be optimal with respect to their minimum distance. Finally, the availability of LRCs is studied. We investigate the locality and availability properties of several classes of one-step majority-logic decodable codes, including cyclic simplex codes, cyclic difference-set codes, and 4-cycle free regular low-density parity-check codes. We also show the construction of a long LRC with availability from a short one-step majority-logic decodable code. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.