A5042001449- Advanced Data Storage Technologies
- Caching and Content Delivery
- Coding theory and cryptography
- Cellular Automata and Applications
- Error Correcting Code Techniques
- Distributed systems and fault tolerance
- Financial Risk and Volatility Modeling
- DNA and Biological Computing
- Cooperative Communication and Network Coding
- Statistical Distribution Estimation and Applications
- Speech and Audio Processing
- Probability and Risk Models
- Photonic Crystal and Fiber Optics
- Ocular and Laser Science Research
- Advanced Fiber Laser Technologies
- Advanced Optical Sensing Technologies
- Music and Audio Processing
- Cryptography and Data Security
- Speech Recognition and Synthesis
- Optical Wireless Communication Technologies
- Network Security and Intrusion Detection
- Random Matrices and Applications
- Plasma Diagnostics and Applications
- Model Reduction and Neural Networks
- VLSI and Analog Circuit Testing
Beijing University of Posts and Telecommunications
2016-2025
Tsinghua University
2013-2023
University Town of Shenzhen
2013-2017
Guizhou University
2017
Institute of Automation
2016
Kennesaw State University
2016
Air Force Engineering University
2008
A code is said to be an r-local locally repairable (LRC) if each of its coordinates can repaired by accessing at most r other coordinates. When some the are also erased, LRC cannot accomplish local repair, which leads concept (r, δ)-locality. q-ary [n, k] linear C have δ)-locality (δ ≥ 2) for coordinate i, there exists a punctured subcode with support containing whose length r+δ-1, and minimum distance least δ. The δ)-LRC tolerate δ-1 erasures in every (i.e., subcode), degenerates when δ =...
In a linear code, code symbol is said to have locality r if it can be repaired by accessing at most other symbols. For an (n, k, r) locally repairable codes (LRC), the important bounds on minimum distances might well-known Singleton-like bound and Cadambe-Mazumdar which takes field size into account. this paper, we study constructions of optimal LRCs from view parity-check matrices. Firstly, all binary meeting are found in sense equivalence codes, i.e., except proposed 4 classes LRCs, there...
A locally repairable code (LRC) is a linear such that every symbol can be recovered by accessing small number of other symbols. In this paper, we study bounds and constructions LRCs from the viewpoint parity-check matrices. Firstly, simple unified framework based on matrix to analyze proposed, several new explicit minimum distance in terms field size are presented. particular, give an alternate proof Singleton-like bound for first proved Gopalan et al. Some structural properties optimal...
Repair locality has been an important metric in a distributed storage system (DSS). Erasure codes with small are more popular DSS, which means fewer available nodes participating the repair process of failed nodes. Locally repairable (LRCs) as new coding scheme have given rise to performance and attracted lot interest theoretical research theory. The particular concern among problems is bounds optimal constructions LRCs. problem LRCs includes most case Singleton-optimal whose minimum...
In distributed storage systems, locally repairable codes (LRCs) have attracted lots of interest recently. If a code symbol can be repaired respectively by t disjoint groups other symbols, each which has size at most r, we say that the (r, t)-locality. LDPC are linear block defined low-density parity-check matrices. A regular (τ, p)-LDPC matrix with uniform column weight τ and row p. this letter, employ to construct optimal binary LRCs t)-locality for information symbols. After proposing...
In an [n, k, d] linear code, a code symbol is said to have locality r if it can be repaired by accessing at most other symbols. For (n, r) locally repairable (LRC), the minimum distance satisfies well-known Singleton-like bound d ≤ n - k [k/r] + 2. this paper, we study optimal ternary LRCs meeting employing parity-check matrix approach. It proved that there are only 8 classes of possible parameters with which exist. Moreover, obtain explicit constructions for all these parameters, where...
A $q$-ary $(n,k,r)$ locally repairable code (LRC) is an $[n,k,d]$ linear over $\mathbb{F}_q$ such that every symbol can be recovered by accessing at most $r$ other symbols. The well-known Singleton-like bound says $d \le n-k-\lceil k/r\rceil +2$ and LRC said to optimal if it attains this bound. In paper, we study the bounds constructions of LRCs from view parity-check matrices. Firstly, a simple unified framework based on matrix analyze proposed. Several useful structural properties are...
As the feature size of semiconductor process is scaling down to 10nm and below, it possible assemble systems with high performance processors that can theoretically provide computational power up tens PLOPS. However, consumption these also rocketing millions watts, actual only around 60% theoretical performance. Today, efficiency sustained have become main foci processor designers. Traditional computing architecture such as superscalar GPGPU are proven be inefficient, there a big gap between...
A novel concept of collision avoidance single-photon light detection and ranging (LIDAR) for vehicles has been demonstrated, in which chaotic pulse position modulation is applied on the transmitted laser pulses robust anti-crosstalk purposes. Besides, detectors (SPD) time correlated single photon counting techniques are adapted, to sense ultra-low power used consideration compact structure eye safety. Parameters including rate, discrimination threshold, number accumulated have thoroughly...
Recently linear codes with locality properties have attracted a lot of interest due to their desirable applications in distributed storage systems. An [n, k, d] code (r, δ)-locality can enable the local recovery failed node case more than one failures. In this paper, we study theoretical bounds and constructions for all symbols. A parity-check matrix approach is employed present an alternate simple proof Singleton-like bound symbol δ)-locality. refined given that r | k + δ - 1 † n. Base on...
A code symbol in an <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$[n,\ k,\ d]$</tex> linear is said to have locality xmlns:xlink="http://www.w3.org/1999/xlink">$r$</tex> if it can be repaired from at most other symbols. An xmlns:xlink="http://www.w3.org/1999/xlink">$(n,\ r)$</tex> locally repairable (LRC) which every has optimal its minimum distance achieves the Singleton-like bound derived by Gopalan et al. In this paper, we study maximal...
As the rapid growth of data, many storage systems have used erasure codes instead replication to reduce cost under same level reliability. Maximum-Distance- Separable (MDS) been most widely adopted, due their optimal efficiency. It is well understood that application in systems, where data less frequently accessed. For which stored cloud accessed (or so-called "hot data"), performance data-retrieving key metric. To best our knowledge, there has only a little work on with codes. They combined...
An (n, k, r) locally repairable code (LRC) is an [n, d] linear where every symbol can be repaired from at most r other symbols. LRC said to optimal if the minimum distance attains Singleton-like bound d ≤ n - k ⌈k/r⌉ + 2. The generalized Hamming weights (GHWs) of codes are fundamental parameters which have many useful applications. In this paper, we study GHWs LRCs. Firstly, obtain a on i-th (1 i k) proposed give when = 1 and reduce classical Singleton there no locality constraint. Then, it...
In distributed storage systems, locally repairable codes (LRCs) are introduced to realize low disk I/O and repair cost. order tolerate multiple node failures, the LRCs with \emph{$(r, δ)$-locality} further proposed. Since hot data is not uncommon in a system, both Zeh \emph{et al.} Kadhe focus on \emph{multiple localities or unequal localities} (ML-LRCs) recently, which said that among code symbols can be different. ML-LRCs attractive useful reducing cost for data. this paper, we generalize...
Cyber security lacks comprehensive theoretical guidance. General theory, as a set of basic theory concepts, is intended to guide cyber and all the other work. The general aims unify main branches establish unified theory. This paper proposal an overview on security, which devoted constructing model network security. hierarchical structure meridian-collateral tree described. Shannon information employed build cyberspace model. Some central concepts i.e., attack defense, are discussed several...
Repair locality has been an important metric in distributed storage systems (DSS). Erasure codes with small are more popular DSS, which means fewer available nodes participating the repair of failed nodes. Locally repairable (LRCs) peoposed as a new coding scheme, give rise to system performance and attract lot interest theoretical research theory. The particular concern among problems is bounds optimal constructions LRCs. In this direction, we first all derive improved upper bound on code...
A code is said to be a $r$-local locally repairable (LRC) if each of its coordinates can repaired by accessing at most $r$ other coordinates. When some the are also erased, LRC not accomplish local repair, which leads concept $(r,\delta)$-locality. $q$-ary $[n, k]$ linear $\cC$ have $(r, \delta)$-locality ($\delta\ge 2$) for coordinate $i$, there exists punctured subcode with support containing whose length $r + \delta - 1$, and minimum distance least $\delta$. The \delta)$-LRC tolerate...
Locally repairable codes (LRCs) are a family of erasure which have been proposed for data storage in distributed systems recently. For an LRC, code symbol is said to locality r and availability t, or (r, t)-locality, if the can be repaired respectively by t disjoint groups other symbols, each has size at most r. [n, k, d] LRCs with length n, dimension minimum distance d t)-locality information repair group contains single parity symbol, Rawat et al. derived Singleton-like bound: ≤ n - k...
Locally repairable codes (LRCs) are important for distributed storage systems due to their efficient repairing ability of the failed nodes. A <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> -ary optimal notation="LaTeX">$(n,k,r)$ -LRC is an notation="LaTeX">$[n,k,d]$ linear code over notation="LaTeX">$\mathbb {F}_{q}$ such that every symbol has locality notation="LaTeX">$r$...
In an $[n,k,d]$ linear code, a code symbol is said to have locality $r$ if it can be repaired by accessing at most other symbols. For $(n,k,r)$ \emph{locally repairable code} (LRC), the minimum distance satisfies well-known Singleton-like bound $d\le n-k-\lceil k/r\rceil +2$. this paper, we study optimal ternary LRCs meeting employing parity-check matrix approach. It proved that there are only $8$ classes of possible parameters with which exist. Moreover, obtain explicit constructions for...
In this paper, we present an analysis of transverse mode competition mechanism in multicore fiber lasers based on the transversally-resolved steady rate equations with consideration gain distribution and propagation loss. Based model, output beam properties 7-core 19-core are simulated numerically when applying a plane reflection mirror Talbot cavity as feedback boundary conditions, respectively. We propose new parameter brightness factor to find out best distance. also give influence core...
We study a new family of random variables that each arise as the distribution maximum or minimum number N i.i.d. X1, X2,…, XN, distributed variable X with support on [0, 1]. The general scheme is first outlined, and several special cases are studied in detail. Wherever appropriate, we find estimates parameter θ one-parameter question.
Recently, codes with locality have been widely studied to deal the node repair problem in distributed storage systems. Locally repairable are linear properties for code symbols. If a symbol can be repaired respectively by t disjoint groups of other symbols, each which has size at most r, this is said (r, t)-locality. In paper, we present recursive bounds LRCs t)-locality all The simple forms and used derive various LRCs. Moreover, it shown that many previous well known derived using our...
A <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$q$</tex> -ary ( xmlns:xlink="http://www.w3.org/1999/xlink">$n, k, r$</tex> ) locally repairable code (LRC) is an [ d$</tex> ] linear where every symbol can be repaired by accessing at most xmlns:xlink="http://www.w3.org/1999/xlink">$r$</tex> other symbols. Its minimum distance satisfies the well-known Singleton-like bound. In this paper, we determine all possible parameters of quaternary LRCs...