SavedAdd your journal

Journals / Istanbul University Journal of Electrical and Electronics Engineering / 2008 / Cilt: 8 - Sayı: 2

Geometric construction codes of Hamming distance-8

Gökmen ALTAY
Pages
665–669
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In this paper, we have enhanced the construction of GC codes with respect to code rate and derived a code family of hamming distance-8 GC codes.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:A new high rate binary linear block code construction technique, named as Geometric Construction (GC) codes, was proposed recently [1].
📊
Key Findings & Data:It generates all the even full information rate (optimal) Hamming distance – 4 codes.
💡
Conclusion & Impact:In this paper, we have enhanced the construction of GC codes with respect to code rate and derived a code family of hamming distance-8 GC codes.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

A new high rate binary linear block code construction technique, named as Geometric Construction (GC) codes, was proposed recently [1]. It generates all the even full information rate (optimal) Hamming distance – 4 codes. In this paper, we have enhanced the construction of GC codes with respect to code rate and derived a code family of hamming distance-8 GC codes.

🔖

Cite This Article

ALTAY, G. (2022). Geometric construction codes of Hamming distance-8. Istanbul University Journal of Electrical and Electronics Engineering, Cilt: 8 - Sayı: 2, 665–669. https://ajindex.com/articles/543769

📄 Full Text PDF Viewer

📄

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

References (9)

  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] 4. Forney, Jr., G.D.: Coset codes II: Binary lattices and related codes. IEEE Trans. Inform. Theory, 1988, 34, pp. 1152-1187
  4. R. M. Pyndiah.: Near-optimum decoding of product codes: Block turbo codes. IEEE Trans. Commun., vol.46, No. 8, pp.1003-1010, Aug. 1998
  5. Peng, X.-H.; Farrell, P.G.: Optimal augmentation of product codes. Electronics Letters, 2004, 40, pp. 750- 752
  6. 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
  7. 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
  8. 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
  9. 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.