Maximum-likelihood decoding of linear codes over erasure channels can be considered as solving a linear system of a column submatrix of the parity-check matrix. In practice, Gaussian elimination is usually applied, and its computational cost depends on the structure of the matrix, especially the sparsity and the fill-i...
Yu-Li Chen, Lai-Gang Guo, Tong-Lei Li et al.· 0 citations
We study cache-aided linear computation in distributed systems where each source generates and stores its own data. An external receiver requests a linear combination of these data, and the sources use information cached before the request is known to reduce the communication needed to recover the requested result. In...
Xiao-Hong Cai, Ru-Ze Zhang, Lai-Gang Guo et al.· 0 citations
Lyapunov constants are a crucial tool for analyzing bifurcation behavior in switching systems. This paper proposes an efficient algebraic symbolic algorithm for computing Lyapunov constants in planar switching systems. By mapping the vector fields into the complex domain, we construct a normal form algorithm based on L...