Sharma-Kaushik partitions have been used to define distances between vectors with $n$-coordinates. In this paper, “difference matrices” for the partitioning classes have been introduced and investigated. It has been shown that the difference matrices are circulant and that the entries of a product of matrices is an extended intersection number of a distance scheme. The sum of the entries of each row or columns of the product matrix has been obtained. The algebra of matrices generated by the difference matrices of the classes of an SK-partition have another natural basis. The relationship between these two bases has been given.
@article{107887,
author = {Bhu Dev Sharma and Norris Sookoo},
title = {The difference matrices of the classes of a Sharma-Kaushik partition},
journal = {Archivum Mathematicum},
volume = {040},
year = {2004},
pages = {23-31},
zbl = {1114.05101},
mrnumber = {2054869},
language = {en},
url = {http://dml.mathdoc.fr/item/107887}
}
Sharma, Bhu Dev; Sookoo, Norris. The difference matrices of the classes of a Sharma-Kaushik partition. Archivum Mathematicum, Tome 040 (2004) pp. 23-31. http://gdmltest.u-ga.fr/item/107887/
Circulant matrices, John Wiley and Sons, New York 1979. | MR 0543191 | Zbl 0898.15021
An algebraic approach to the association schemes of coding theory, Philips J. Res. Rep. Suppl. 10 (1973). | MR 0384310 | Zbl 1075.05606
Burst-error-correcting codes with weight contraints under a new metric, J. Cybern. 8 (1978), 183–202. | MR 0490422
Single error and burst error correcting codes through a new metric, J. Cybern. 9 (1979), 1–15. | MR 0515585 | Zbl 0412.94023
Necessary and sufficient number of parity-checks correcting random errors and burst with weight constraints under a new metric, J. Cybern. 9 (1979), 81–90. | MR 0543880
Random error detecting and burst error correcting codes under a new metric, Indian J. Pure Appl. Math. 10 (1979), 1460–1468. | MR 0551784 | Zbl 0421.94013
A new metric in the study of error correcting codes, Ph.D. Thesis, University of Delhi (1979).
Channels and bounds for class-metric codes, Rev. Roumaine Math. Pures Appl. 26 (1981), 1345–1350. | MR 0646403 | Zbl 0481.94008
Some tighter bounds on code size with Sharma-Kaushik metrics, Presented at the Intern. Conf. on Math., Mao, Menorca, June 15–17, 1987.
Error correcting codes through a new metric, 41st Annual Conf. Intern. Stat. Inst., New Delhi 1977.
Limites intensity random and burst error codes with class-weight considerations, Elektron. Inform.-verarb. Kybernetik 15 (1979), 315–321. | MR 0553671
Algebra of Sharma and Kaushik’s metric inducing partitions of $Z_q$, J. Combin. Inform. System Sci. 11 (1986), 19–32. | MR 0959671
Association and other schemes related to Sharma-Kaushik class of distances over finite rings, Le Matematiche, Vol. XLV, Fasc. I (1990), 163–185. | MR 1181005
Lectures Notes in Mathematics, Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Springer-Verlag, Berlin 1972. | MR 0392580