We present two constructions for binary selforthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R = 1/2, by our constructive lower bound, the relative minimum distance δ ≈ 0.0595 (for GV bound, δ ≈ 0.110). Moreover, we have proved that the binary selforthogonal codes asymptotically achieve the...

The 5th generation (5G) mobile communication system requires high throughput for high quality user experience. In this paper, a novel Hybrid Automatic Repeat Request (HARQ) scheme based on packet coding is proposed. The idea is that a parity block is transmitted when code block error rate (CBER) of all turbo code blocks of transmission packet is less than or equal to the threshold of P0 and gre...

In this paper we study polycyclic codes of length p1 × · · · × pn over Fpa generated by a single monomial. These codes form a special class of abelian codes. We show that these codes arise from the product of certain single variable codes and we determine their minimum Hamming distance. Finally we extend the results of Massey et. al. in [10] on the weight retaining property of monomials in one ...

Random heteropolymers ~RHPs! with uncorrelated sequence fluctuations on the segmental scale can undergo a transition wherein, below a certain temperature, the thermodynamics is determined by a few dominant conformations. We study this ‘‘freezing’’ transition for RHPs with correlated sequence fluctuations. Specifically, we apply our theory to the case where the correlations decay with a single c...