Satish Kumar, Harshdeep Singh, Indivar Gupta, Ashok Ji Gupta
{"title":"MDS codes based on orthogonality of quasigroups","authors":"Satish Kumar, Harshdeep Singh, Indivar Gupta, Ashok Ji Gupta","doi":"10.1007/s00200-023-00631-5","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we propose a novel method for constructing maximum distance separable (MDS) codes based on the extended invertibility and orthogonality of quasigroups. We provide various methods of constructing an orthogonal system of <i>k</i>-ary operations over <span>\\(Q^2\\)</span> using a special type of <i>k</i>-ary operations over <i>Q</i>, where <i>Q</i> is any arbitrary finite set. Then we use concepts of strong orthogonality of <i>k</i>-ary operations to establish a connection between orthogonality and linear recursive MDS codes. We illustrate these new classes of MDS codes using the proposed techniques and enumerate such codes using SageMath.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":"36 4","pages":"659 - 680"},"PeriodicalIF":0.6000,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Algebra in Engineering Communication and Computing","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s00200-023-00631-5","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose a novel method for constructing maximum distance separable (MDS) codes based on the extended invertibility and orthogonality of quasigroups. We provide various methods of constructing an orthogonal system of k-ary operations over \(Q^2\) using a special type of k-ary operations over Q, where Q is any arbitrary finite set. Then we use concepts of strong orthogonality of k-ary operations to establish a connection between orthogonality and linear recursive MDS codes. We illustrate these new classes of MDS codes using the proposed techniques and enumerate such codes using SageMath.
期刊介绍:
Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems.
Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology.
Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal.
On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.