Please use this identifier to cite or link to this item:
|Title:||Optimal family of q-ary codes obtained from a substructure of generalised Hadamard matrices||Authors:||Bracken, Carl
Chee, Yeow Meng
|Keywords:||DRNTU::Science::Mathematics||Issue Date:||2012||Source:||Bracken, C., Chee, Y. M., & Purkayastha, P. (2012). Optimal family of q-ary codes obtained from a substructure of generalised Hadamard matrices. 2012 IEEE International Symposium on Information Theory - ISIT, pp.116-119.||Abstract:||In this article we construct an infinite family of linear error correcting codes over Fq for any prime power q. The code parameters are [q2t + qt-1 - q2t-1 - qt, 2t+1, q2t + q2t-2 + qt-1 - 2q2t-1 - qt]q, for any positive integer t. This family is a generalisation of the optimal self-complementary binary codes with parameters [2u2 - u, 2t + 1, u2 - u]2, where u = 2t-1. The codes are obtained by considering a submatrix of a specially constructed generalised Hadamard matrix. The optimality of the family is confirmed by using a recently derived generalisation of the Grey-Rankin bound when t >; 1, and the Griesmer bound when t = 1.||URI:||https://hdl.handle.net/10356/102595
|DOI:||10.1109/ISIT.2012.6283038||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SPMS Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.