参考文献:1. Litwin L. and Pugel M. (2001). The principles of OFDM. / RF Des. 24: 30鈥?8 2. Chou W. and Neifeld M. (1998). Interleaving and error correction in volume holographic memory systems. / Appl. Opt. 37: 6951鈥?968 CrossRef 3. Sehlstedt M., LeBlanc J.P.: Nonuniform bit-energy distribution in wireless video frames. In: Second Finnish Wireless Communications Workshop, pp. 13鈥?8. Tampere University of Technology, Tampere (2001). 4. Hossein P.N., Nazanin R. and Faramarz F. (2005). Nonuniform error correcting using low-density parity-check codes. / IEEE Trans. Inform. Theory 51(7): 292鈥?95 5. Park J. and Moon J. (2009). Error-pattern-correcting cyclic codes tailored to a prescribed set of error cluster patterns. / IEEE Trans. Inform. Theory 55(4): 1747鈥?765 CrossRef 6. Deza M., Karpovsky M.G. and Milman V.S. (1981). Codes correcting arbitrary sets of errors. / Revue de Cethedec 66: 65鈥?6 7. Deza M. and Deza E. (2009). Encyclopedia of Distances. Springer, Berlin CrossRef 8. Shekhunova N.A. and Mironchikov E.T. (1981). Cyclic ( / L, / G)-codes. / Probl. Inform. Transm. 17(2): 3鈥? 9. Bezzateev S.V., Shekhunova N.A.: Generalized Goppa codes for correcting localized errors. In: IEEE International Symposium on Information Theory, p. 377. IEEE, Boston (1998). 10. Goppa V.D. (1970). A new class of linear error correcting codes. / Probl. Inform. Transm. 6(3): 24鈥?0 11. MacWilliams F.J. and Sloane N.J.A. (1977). The Theory of Error-Correcting Codes. North-Holland, Amsterdam 12. Leng S. (1993). Algebra. Addison, Reading 13. Carlitz L. (1932). The arithmetic of polynomials in a Galois field. / Am. J. Math. 54: 39鈥?0 CrossRef 14. Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http://www.codetables.de. Accessed 2 Sept 2009.
作者单位:Sergey Bezzateev (1) Natalia Shekhunova (1)
1. Saint Petersburg State University of Aerospace Instrumentation, St. Petersburg, 190000, Russia
ISSN:1573-7586
文摘
A weighted Hamming metric is considered. A class of binary linear codes consistent with the weighted Hamming metric is discussed. A class of binary generalized Goppa codes perfect in the weighted Hamming metric is offered.