9 research outputs found

    Lowest density MDS codes over extension alphabets

    Full text link

    On encoding symbol degrees of array BP-XOR codes

    Get PDF
    Low density parity check (LDPC) codes, LT codes and digital fountain techniques have received significant attention from both academics and industry in the past few years. By employing the underlying ideas of efficient Belief Propagation (BP) decoding process (also called iterative message passing decoding process) on binary erasure channels (BEC) in LDPC codes, Wang has recently introduced the concept of array BP-XOR codes and showed the necessary and sufficient conditions for MDS [k + 2,k] and [n,2] array BP-XOR codes. In this paper, we analyze the encoding symbol degree requirements for array BP-XOR codes and present new necessary conditions for array BP-XOR codes. These new necessary conditions are used as a guideline for constructing several array BP-XOR codes and for presenting a complete characterization (necessary and sufficient conditions) of degree two array BP-XOR codes and for designing new edge-colored graphs. Meanwhile, these new necessary conditions are used to show that the codes by Feng, Deng, Bao, and Shen in IEEE Transactions on Computers are incorrect

    Glauber Dynamics for the mean-field Potts Model

    Full text link
    We study Glauber dynamics for the mean-field (Curie-Weiss) Potts model with q3q\geq 3 states and show that it undergoes a critical slowdown at an inverse-temperature βs(q)\beta_s(q) strictly lower than the critical βc(q)\beta_c(q) for uniqueness of the thermodynamic limit. The dynamical critical βs(q)\beta_s(q) is the spinodal point marking the onset of metastability. We prove that when β<βs(q)\beta<\beta_s(q) the mixing time is asymptotically C(β,q)nlognC(\beta, q) n \log n and the dynamics exhibits the cutoff phenomena, a sharp transition in mixing, with a window of order nn. At β=βs(q)\beta=\beta_s(q) the dynamics no longer exhibits cutoff and its mixing obeys a power-law of order n4/3n^{4/3}. For β>βs(q)\beta>\beta_s(q) the mixing time is exponentially large in nn. Furthermore, as ββs\beta \uparrow \beta_s with nn, the mixing time interpolates smoothly from subcritical to critical behavior, with the latter reached at a scaling window of O(n2/3)O(n^{-2/3}) around βs\beta_s. These results form the first complete analysis of mixing around the critical dynamical temperature --- including the critical power law --- for a model with a first order phase transition.Comment: 45 pages, 5 figure
    corecore