中意绿色能源实验室建设事宜通报Xidian.ppt

Although, the linear codes with long length are most often applied in wireless communication, the codes with short length still exist in industry, for example, some storage systems, the TFCI of 3G (or 4G) system, some data with short length but need strong protection, etc. Codeword with Long Length or Short Length For the codes with short length, the previous classic bounds can help you directly. For the codes with long length, the asymptotic forms of the previous classic bounds still work. In this topic, we consider some problems in the field of Hamming distance with short codeword length. Hamming distance is generalized for the description of trellis complexity of linear block codes (David Forney) and for the description of security problems (Victor Wei). We also generalized the concept to consider the relationship between a code and a subcode: One way is: Hamming distance, generalized Hamming Distance, … In the following, we consider the Hamming distance in a variational system. For example, when the encoding and decoding devices were almost selected, but the transmission rate does not need to be high in a period (in the evening not so much users), see next slide, then more redundancies can be borrowed to improve the decoding ability. What should we do to realize this idea ? And what is the principle ? Another Direction is: Hamming distance, distance profile, … The TFCI in 3G system Details In linear coding theory, when the number of input bits increases or decreases, some basis codewords of the generator matrix will be included or excluded, respectively. For a given linear block code, we consider: ※ how to select a generator matrix and then ※ how to include or exclude the basis codewords of the generator one by one ※ while keeping the minimum distances (of the generated subcodes) as large as possible. Big Problem In general case, the algebraic structure may be lost in subcode although the properties of the original code are nice. Then how t