Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGeneralized $b$-weights and $b$-MDS Codes
122
0
0.0
(
0
)
Added by
Xu Pan
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Authors
Xu Pan
Ask ChatGPT about the research
No Arabic abstract
In this paper, we first introduce the notion of generalized $b$-weights of $[n,k]$-linear codes over finite fields, and obtain some basic properties and bounds of generalized $b$-weights of linear codes which is called Singleton bound for generalized $b$-weights in this paper. Then we obtain a necessary and sufficient condition for an $[n,k]$-linear code to be a $b$-MDS code by using generator matrixes of this linear code and parity check matrixes of this linear code respectively. Next a theorem of a necessary and sufficient condition for a linear isomorphism preserving $b$-weights between two linear codes is obtained, in particular when $b=1$, this theorem is the MacWilliams extension theorem. Then we give a reduction theorem for the MDS conjecture. Finally, we calculate the generalized $b$-weight matrix $D(C)$ when $C$ is simplex codes or two especial Hamming codes.
rate research
Read More
Streaming codes represent a packet-level FEC scheme for achieving reliable, low-latency communication. In the literature on streaming codes, the commonly-assumed Gilbert-Elliott channel model, is replaced by a more tractable, delay-constrained, sliding-window (DCSW) channel model that can introduce either random or burst erasures. The known streaming codes that are rate optimal over the DCSW channel model are constructed by diagonally embedding a scalar block code across successive packets. These code constructions have field size that is quadratic in the delay parameter $tau$ and have a somewhat complex structure with an involved decoding procedure. This led to the introduction of simple streaming (SS) codes in which diagonal embedding is replaced by staggered-diagonal embedding (SDE). The SDE approach reduces the impact of a burst of erasures and makes it possible to construct near-rate-optimal streaming codes using Maximum Distance Separable (MDS) code having linear field size. The present paper takes this development one step further, by retaining the staggered-diagonal feature, but permitting the placement of more than one code symbol from a given scalar codeword within each packet. These generalized, simple streaming codes allow us to improve upon the rate of SS codes, while retaining the simplicity of working with MDS codes. We characterize the maximum code rate of streaming codes under a constraint on the number of contiguous packets over which symbols of the underlying scalar code are dispersed. Such a constraint leads to simplified code construction and reduced-complexity decoding.
Maximum distance separable (MDS) codes are optimal where the minimum distance cannot be improved for a given length and code size. Twisted Reed-Solomon codes over finite fields were introduced in 2017, which are generalization of Reed-Solomon codes. Twisted Reed-Solomon codes can be applied in cryptography which prefer the codes with large minimum distance. MDS codes can be constructed from twisted Reed-Solomon codes, and most of them are not equivalent to Reed-Solomon codes. In this paper, we first generalize twisted Reed-Solomon codes to generalized twisted Reed-Solomon codes, then we give some new explicit constructions of MDS (generalized) twisted Reed-Solomon codes. In some cases, our constructions can get MDS codes with the length longer than the constructions of previous works. Linear complementary dual (LCD) codes are linear codes that intersect with their duals trivially. LCD codes can be applied in cryptography. This application of LCD codes renewed the interest in the construction of LCD codes having a large minimum distance. We also provide new constructions of LCD MDS codes from generalized twisted Reed-Solomon codes.
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the generalized Hamming weights of three classes of linear codes constructed through defining sets and determine them partly for some cases. Particularly, in the semiprimitive case we solve an problem left in Yang et al. (IEEE Trans. Inf. Theory 61(9): 4905--4913, 2015).
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure correcting codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes with local regeneration where each local code is a bandwidth-optimal regenerating MDS code. In the event of a node failure, these codes reduce both, the number of servers that have to be contacted as well as the amount of network traffic required for the repair process. The constructions require significantly smaller field size than the only other construction known in literature. Further, we present a construction of PMDS codes with global regeneration which allow to efficiently repair patterns of node failures that exceed the local erasure correction capability of the code and thereby invoke repair across different local groups.
In this paper, we propose a mechanism on the constructions of MDS codes with arbitrary dimensions of Euclidean hulls. Precisely, we construct (extended) generalized Reed-Solomon(GRS) codes with assigned dimensions of Euclidean hulls from self-orthogonal GRS codes. It turns out that our constructions are more general than previous works on Euclidean hulls of (extended) GRS codes.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
