Deciphering the Feature Representation of Deep Neural Networks for High-Performance AI. [PDF]
IEEE Trans Pattern Anal Mach IntellIslam MT, Xing L.
europepmc +1 more source
A Support vector machine-based mixture cure model for mixed case interval censored data. [PDF]
Stat ComputPal S, Aselisewine W.
europepmc +1 more source
Efficient Likelihood-Based Temporal Changepoint Detection in Spatio-Temporal Processes. [PDF]
Stat ComputAgarwal G, Eckley IA, Fearnhead P.
europepmc +1 more source
Enhancing collective entanglement witnesses through correlation with state purity. [PDF]
Sci RepJiráková K +3 more
europepmc +1 more source
Real-Time Radar-Based Hand Motion Recognition on FPGA Using a Hybrid Deep Learning Model. [PDF]
Sensors (Basel)Ahmed TS +4 more
europepmc +1 more source
Distinct roles of hippocampus and neocortex in symbolic compositional generalization
Liang Z +5 more
europepmc +1 more source
Related searches:
Maximum Distance Separable Codes
A Course in Algebraic Error-Correcting Codes, 2020Two codewords of a block code of length n and minimum distance d must differ on any set of n − d + 1 coordinates, since they are at distance at least d from each other. This observation leads to the Singleton bound, Theorem 6.1. A code whose parameters give an equality in the Singleton bound is called a maximum distance separable code or simply an MDS ...
Simeon Ball
semanticscholar +2 more sources
Maximum Distance Separable Array Codes Allowing Partial Collaboration
IEEE Communications Letters, 2020This letter considers the problem of repairing multiple node failures through partial collaboration in a distributed storage system (DSS). In the repair process, each failed node firstly connects to $d\geq k$ alive nodes to download data, and then ...
Yuejia Zhang, Shiqiu Liu, Li Chen
semanticscholar +2 more sources
Pseudocyclic maximum- distance-separable codes
IEEE Transactions on Information Theory, 1990The (n, k) pseudocyclic maximum-distance-separable (MDS) codes modulo (x/sup n/-a) over GF(q) are considered. Suppose that n is a divisor of q+1. If n is odd, pseudocyclic MDS codes exist for all k. However, if n is even, nontrivial pseudocyclic MDS codes exist for odd k (but not for even k) if a is a quadratic residue in GF(q), and they exist for even
A. Krishna, D. Sarwate
semanticscholar +2 more sources
Short Nonbinary Maximum Distance Separable Cycle Codes
IEEE Communications Letters, 2018This letter presents a class of very short nonbinary cycle codes that are maximum distance separable (MDS). It is proved that there is one and only one regular graph on which MDS cycle codes may be constructed and only for finite field orders larger than or equal to 5.
B. Matuz, G. Liva, E. Paolini
semanticscholar +3 more sources