KaydedilenlerDerginizi ekleyin

Dergiler / Electrica / 2008 / Cilt: 8 Sayı: 2

GEOMETRIC CONSTRUCTION CODES OF HAMMING DISTANCE-8

Gökmen ALTAY
Sayfa
665–669
Yayın Tarihi
2012-01-02
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

GEOMETRIC CONSTRUCTION CODES OF HAMMING DISTANCE-8

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:GEOMETRIC CONSTRUCTION CODES OF HAMMING DISTANCE-8
📊
Temel Bulgular & Veri:GEOMETRIC CONSTRUCTION CODES OF HAMMING DISTANCE-8
💡
Sonuç & Katkı:GEOMETRIC CONSTRUCTION CODES OF HAMMING DISTANCE-8
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Linear block codes · code construction

Abstract

GEOMETRIC CONSTRUCTION CODES OF HAMMING DISTANCE-8

🔖

Bu Makaleye Atıf Yap

ALTAY, G. (2012). GEOMETRIC CONSTRUCTION CODES OF HAMMING DISTANCE-8. Electrica, Cilt: 8 Sayı: 2, 665–669. https://ajindex.com/articles/1017587

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (7)

  1. Altay, G.; Ucan, O.N.: Heuristic construction of high-rate linear block codes. Int. J. Electron. Commun. (AEÜ), vol.60, pp.663-666, 2006.
  2. Bossert, M.: Channel Coding, Wiley, 1999.
  3. Williams, M.F.J.; Sloane, N.J.A.: The Theory of Error-Correcting Codes. (North-Holland, Amsterdam, 1998. 4. Forney, Jr., G.D.: Coset codes II: Binary lattices and related codes. IEEE Trans. Inform. Theory, 1988, 34, pp. 1152-1187. R. M. Pyndiah.: Near-optimum decoding of product codes: Block turbo codes. IEEE Trans. Commun., vol.46, No. 8, pp.1003-1010, Aug. 1998.
  4. Peng, X.-H.; Farrell, P.G.: Optimal augmentation of product codes. Electronics Letters, 2004, 40, pp. 750- 752. Salomon, A.J.; Amrani, O.: Augmented product codes and lattices: Reed-Muller codes and Barnes-Wall lattices. Trans. Inform. Theory, November 2005, vol.51, No. 11, pp. 1152-1187.
  5. Brouwer, A. E.; Verhoeff, T.: An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory, vol. 39, No. 2, pp. 664-677, March 1993.
  6. Lucas, R.; Fossorier, M.P.C.; Kou, Y.; Lin, S.: Iterative decoding of one-step majority logic decodable codes based on belief propagation. IEEE Trans. Commun., vol.48, pp.931-937, June 2000.
  7. Jhonson, S. J.; Weller, S.R.: A family of irregular LDPC codes with low encoding complexity. IEEE Comm. Letter, vol. 7, pp.79-81, No. 2, Feb. 2003.