Construction of error-correcting codes from finite geometries and their applications in secure data storage systems
Simranjeet Nandasimranjeet.nanda.orp@chitkara.edu.inCentre for Research Impact & OutcomeChitkara University Institute of Engineering and TechnologyChitkara UniversityRajpura, Punjab, 140401, India0009-0005-6893-8585View full profile → , *Arsh GoyalCorresponding authoraarshgoyal@gmail.comQuantum University Research CenterQuantum UniversityRoorkee, Uttarakhand, 247667, India0009-0009-1847-4064View full profile → , Karan PandreKaranPandre2024@protonmail.comCentre for Multidisciplinary ResearchAnurag UniversityHyderabad, Telangana, 500088, India0009-0001-0631-4006View full profile → , Arpita A. Prajapatiaaprajapati.ce.hcet@gokuluniversity.ac.inFaculty of EngineeringGokul Global UniversitySidhpur, Gujarat, 384151, India0009-0003-8878-9762View full profile → , Tirukoti Sudha Ranisudharani.tirukoti@adityauniversity.inDepartment of Computer Science & EngineeringAditya UniversitySurampalem, Kakinada District, Andhra Pradesh, 533437, IndiaView full profile → , Hitendra Garghitendra.garg@gla.ac.inDepartment of Computer Engineering & ApplicationsGLA UniversityMathura, Uttar Pradesh, 281406, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Apr 2026
- Published Online:
- 31 Oct 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-3082
- Pages:
- 4671–4682
Abstract
The fast expanding distributed and cloud-based storage systems have escalated the necessity to have strong error-correcting protocols that guarantee data integrity, reliability, and security. The conventional coding schemes are usually limited in scalability and structural efficiency when they are implemented in massive storage settings. The paper presents a new model to build error-correcting codes based on finite geometries, with the help of the combinatorial constructions like projective and affine planes, to become more redundancy and fault-tolerant. The algorithm combines geometry-based code construction with algebraic encoding and decoding, which allows to effectively detect and correct errors in high-noise scenarios. Experimental assessments reveal that the model proposed has an error correction rate of 96.7% which is more reliable than classical Reed-Solomon codes and the error correction rate less than the classical error correction rate. The framework also provides a high level of resiliency to data corruption and provides a scalable storage architecture. These results suggest that finite geometry-based codes have a promising future in building secure, efficient and high-performance data storage systems.
Keywords
Subject Classifications
References
[1] M. M. Hazzazi, R. R. Budaraju, Z. Bassfar, A. Albakri, and S. Mishra, “A finite state machine-based improved cryptographic technique,” Mathematics, vol. 11, no. 10, Art. no. 2225 (2023), doi: 10.3390/math11102225.
[2] S. Ali, A. S. Alali, E. S. Oztas, and P. Sharma, “Construction of quantum codes over the class of commutative rings and their applications to DNA codes,” Mathematics, vol. 11, no. 6, Art. no. 1430 (2023), doi: 10.3390/math11061430.
[3] A. Bashir, N. Farooq, A. Pervaiz, and A. H. Mir, “Security comparison of NTRU-Encrypt and ECC in smart healthcare systems,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 3, pp. 1249–1265 (2026), doi: 10.47974/JDMSC-2220.
[4] Q. Zhao, H. Mao, Y. Qiao, A. A. A. El-Latif, and Q. Li, “A remote quantum error-correcting code preparation protocol on cluster states,” Mathematics, vol. 11, no. 14, Art. no. 3035 (2023), doi: 10.3390/math11143035.
[5] S. Çalkavur and P. Solé, “Some multisecret-sharing schemes over finite fields,” Mathematics, vol. 8, no. 5, Art. no. 654 (2020), doi: 10.3390/math8050654.
[6] L.-J. Saiz-Adalid, J. Gracia-Morán, D. Gil-Tomás, J.-C. Baraza-Calvo, and P.-J. Gil-Vicente, “Reducing the overhead of BCH codes: New double error correction codes,” Electronics, vol. 9, no. 11, Art. no. 1897 (2020), doi: 10.3390/electronics9111897.
[7] V. A. Jujare, K. Shipra, P. R. Rege, R. Dwivedi, K. Tejaswi, and K. B. V. R. N. Simham, “Implementation of heuristic combinatorial algorithms based on binomial coefficients for network design,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 2-A, pp. 479–487 (2026), doi: 10.47974/JDMSC-2483.
[8] E. Bellini, C. Marcolla, and N. Murru, “An application of p-Fibonacci error-correcting codes to cryptography,” Mathematics, vol. 9, no. 7, Art. no. 789 (2021), doi: 10.3390/math9070789.
[9] S. Sayedsalehi, N. Bagherzadeh, A. A. Del Barrio, G. Botella, and R. Pilipović, “Developing and analyzing the defect-based surface codes using optimization algorithms,” Quantum Rep., vol. 7, no. 2, Art. no. 25 (2025), doi: 10.3390/quantum7020025.
[10] J. Freudenberger and J.-P. Thiers, “A new class of q-ary codes for the McEliece cryptosystem,” Cryptography, vol. 5, no. 1, Art. no. 11 (2021), doi: 10.3390/cryptography5010011.
