The search functionality is under construction.

Author Search Result

[Author] Lingjun KONG(3hit)

1-3hit
  • Mutual Information Approximation Based Polar Code Design for 4Tb/in2 2D-ISI Channels

    Lingjun KONG  Haiyang LIU  Jin TIAN  Shunwai ZHANG  Shengmei ZHAO  Yi FANG  

     
    LETTER-Coding Theory

      Pubricized:
    2021/02/16
      Vol:
    E104-A No:8
      Page(s):
    1075-1079

    In this letter, a method for the construction of polar codes based on the mutual information approximation (MIA) is proposed for the 4Tb/in2 two-dimensional inter-symbol interference (2D-ISI) channels, such as the bit-patterned magnetic recording (BPMR) and two-dimensional magnetic recording (TDMR). The basic idea is to exploit the MIA between the input and output of a 2D detector to establish a log-likelihood ratio (LLR) distribution model based on the MIA results, which compensates the gap caused by the 2D ISI channel. Consequently, the polar codes obtained by the optimization techniques previously developed for the additive white Gaussian noise (AWGN) channels can also have satisfactory performances over 2D-ISI channels. Simulated results show that the proposed polar codes can outperform the polar codes constructed by the traditional methods over 4Tb/in2 2D-ISI channels.

  • Structural Analysis of Nonbinary Cyclic and Quasi-Cyclic LDPC Codes with α-Multiplied Parity-Check Matrices

    Haiyang LIU  Hao ZHANG  Lianrong MA  Lingjun KONG  

     
    LETTER-Coding Theory

      Pubricized:
    2020/05/12
      Vol:
    E103-A No:11
      Page(s):
    1299-1303

    In this letter, the structural analysis of nonbinary cyclic and quasi-cyclic (QC) low-density parity-check (LDPC) codes with α-multiplied parity-check matrices (PCMs) is concerned. Using analytical methods, several structural parameters of nonbinary cyclic and QC LDPC codes with α-multiplied PCMs are determined. In particular, some classes of nonbinary LDPC codes constructed from finite fields and finite geometries are shown to have good minimum and stopping distances properties, which may explain to some extent their wonderful decoding performances.

  • More on Incorrigible Sets of Binary Linear Codes

    Lingjun KONG  Haiyang LIU  Lianrong MA  

     
    LETTER-Coding Theory

      Pubricized:
    2022/10/31
      Vol:
    E106-A No:5
      Page(s):
    863-867

    This letter is concerned with incorrigible sets of binary linear codes. For a given binary linear code C, we represent the numbers of incorrigible sets of size up to ⌈3/2d - 1⌉ using the weight enumerator of C, where d is the minimum distance of C. In addition, we determine the incorrigible set enumerators of binary Golay codes G23 and G24 through combinatorial methods.