Papers by Olufemi O Olaewe
Mathematics and computer science, Apr 29, 2024
The Hoffman's algorithm to test equivalency of linear codes is one of the techniques that have be... more The Hoffman's algorithm to test equivalency of linear codes is one of the techniques that have been used over the years; it is achieved by a comparison of codewords of the linear codes. However, this comparison technique becomes ineffective in instances where it is applied to linear codes with larger dimensions as it requires much run time complexity, space and size in comparing the codewords of each linear code. This paper proposes an optimised algorithm for testing the equivalency of linear codes, specifically addressing the limitations of the Hoffman method. To assess and compare the efficiencies of the Hoffman algorithm and the optimised algorithm, a set of nine carefully selected linear codes were subjected to equivalency testing. The CPU runtime of both algorithms was recorded using the C++ chrono library. The recorded runtime data was then utilized to create a scatter plot, offering a visual representation of the contrasting trends in CPU runtime between the two algorithms. The plot clearly indicate exponential growth in CPU runtime for the Hoffman algorithm as the length and dimension of the linear codes increases, in contrast, the proposed algorithm showcased a minimal growth in CPU runtime, indicating its superior efficiency and optimised performance.
![Research paper thumbnail of Enhancing Data Access Security through the Utilization of [2048,512,4] Linear Code](https://attachments.academia-assets.com/117952096/thumbnails/1.jpg)
Journal of advances in mathematics and computer science, Feb 12, 2024
Linear code is a type of error-correcting code that satisfies the property of closure under addit... more Linear code is a type of error-correcting code that satisfies the property of closure under addition. Linear codes have been a major component in data security and cryptography and has been proven as an important tool in maintaining privacy. Linear code, [n,k,d] is a type of linear code with specific parameters that describe its properties and capabilities with n being the length of codewords, k, the dimension of the code and d denotes the minimum Hamming distance. Code [2048,512,4] is an example of [n,k,d] Linear code with large codeword length, high dimension and a moderate minimum hamming distance. It was generated by a combination of two of [1024,256,] linear code and its validity has been verified and confirmed using Gilbert Varshamov bound. This paper proposes a technique to enhance data access security by utilizing linear code [2048,512,. The proposed algorithm utilizes a sophisticated linear code equivalence test methodology to create a robust and secure system that generates and validates unique [2048, 512, linear codes. These codes serve as highly effective authentication mechanisms, granting individualized access privileges to different
The Hoffman's algorithm to test equivalency of linear codes is one of the techniques that have be... more The Hoffman's algorithm to test equivalency of linear codes is one of the techniques that have been used over the years; it is achieved by a comparison of codewords of the linear codes. However, this comparison technique becomes ineffective in instances where it is applied to linear codes with larger dimensions as it requires much run time complexity, space and size in comparing the codewords of each linear code. This paper proposes an optimised algorithm for testing the equivalency of linear codes, specifically addressing the limitations of the Hoffman method. To assess and compare the efficiencies of the Hoffman algorithm and the optimised algorithm, a set of nine carefully selected linear codes were subjected to equivalency testing. The CPU runtime of both algorithms was recorded using the C++ chrono library. The recorded runtime data was then utilized to create a scatter plot, offering a visual representation of the contrasting trends in CPU runtime between the two algorithms. The plot clearly indicate exponential growth in CPU runtime for the Hoffman algorithm as the length and dimension of the linear codes increases, in contrast, the proposed algorithm showcased a minimal growth in CPU runtime, indicating its superior efficiency and optimised performance.
![Research paper thumbnail of Enhancing Data Access Security through the Utilization of [2048,512,4] Linear Code](https://attachments.academia-assets.com/111485606/thumbnails/1.jpg)
Linear code is a type of error-correcting code that satisfies the property of closure under addit... more Linear code is a type of error-correcting code that satisfies the property of closure under addition. Linear codes have been a major component in data security and cryptography and has been proven as an important tool in maintaining privacy. Linear code, [n,k,d] is a type of linear code with specific parameters that describe its properties and capabilities with n being the length of codewords, k, the dimension of the code and d denotes the minimum Hamming distance. Code [2048,512,4] is an example of [n,k,d] Linear code with large codeword length, high dimension and a moderate minimum hamming distance. It was generated by a combination of two of [1024,256,4] linear code and its validity has been verified and confirmed using Gilbert Varshamov bound. This paper proposes a technique to enhance data access security by utilizing linear code [2048,512,4]. The proposed algorithm utilizes a sophisticated linear code equivalence test methodology to create a robust and secure system that generates and validates unique [2048, 512, 4] linear codes. These codes serve as highly effective authentication mechanisms, granting individualized access privileges to different
Uploads
Papers by Olufemi O Olaewe