Previous |  Up |  Next

Article

Title: The difference matrices of the classes of a Sharma-Kaushik partition (English)
Author: Sharma, Bhu Dev
Author: Sookoo, Norris
Language: English
Journal: Archivum Mathematicum
ISSN: 0044-8753 (print)
ISSN: 1212-5059 (online)
Volume: 40
Issue: 1
Year: 2004
Pages: 23-31
Summary lang: English
.
Category: math
.
Summary: 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. (English)
Keyword: SK-partitions
Keyword: distance scheme
Keyword: extended intersection number
MSC: 05B10
MSC: 05B20
MSC: 05E30
MSC: 94B99
idZBL: Zbl 1114.05101
idMR: MR2054869
.
Date available: 2008-06-06T22:42:46Z
Last updated: 2012-05-10
Stable URL: http://hdl.handle.net/10338.dmlcz/107887
.
Reference: [1] Davis, P. J.: Circulant matrices.John Wiley and Sons, New York 1979. Zbl 0898.15021, MR 0543191
Reference: [2] Delsarte, P.: An algebraic approach to the association schemes of coding theory.Philips J. Res. Rep. Suppl. 10 (1973). Zbl 1075.05606, MR 0384310
Reference: [3] Kaushik, M. L.: Burst-error-correcting codes with weight contraints under a new metric.J. Cybern. 8 (1978), 183–202. MR 0490422
Reference: [4] Kaushik, M. L.: Single error and burst error correcting codes through a new metric.J. Cybern. 9 (1979), 1–15. Zbl 0412.94023, MR 0515585
Reference: [5] Kaushik, M. L.: 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
Reference: [6] Kaushik, M. L.: Random error detecting and burst error correcting codes under a new metric.Indian J. Pure Appl. Math. 10 (1979), 1460–1468. Zbl 0421.94013, MR 0551784
Reference: [7] Kaushik, M. L.: A new metric in the study of error correcting codes.Ph.D. Thesis, University of Delhi (1979).
Reference: [8] Kaushik, M. L.: Channels and bounds for class-metric codes.Rev. Roumaine Math. Pures Appl. 26 (1981), 1345–1350. Zbl 0481.94008, MR 0646403
Reference: [9] Sharma, B. D.  and Dial, G.: Some tighter bounds on code size with Sharma-Kaushik metrics.Presented at the Intern. Conf. on Math., Mao, Menorca, June 15–17, 1987.
Reference: [10] Sharma, B. D. and Kaushik M. L.: Error correcting codes through a new metric.41st Annual Conf. Intern. Stat. Inst., New Delhi 1977.
Reference: [11] Sharma, B. D. and Kaushik M. L.: Limites intensity random and burst error codes with class-weight considerations.Elektron. Inform.-verarb. Kybernetik 15 (1979), 315–321. MR 0553671
Reference: [12] Sharma, B. D. and Kaushik M. L.: Algebra of Sharma and Kaushik’s metric inducing partitions of $Z_q$.J. Combin. Inform. System Sci. 11 (1986), 19–32. MR 0959671
Reference: [13] Sharma, B. D. and Sookoo, N.: 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
Reference: [14] Wallis, W. D., Street, A.  P.  and Wallis, J. S.: Lectures Notes in Mathematics, Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices.Springer-Verlag, Berlin 1972. MR 0392580
.

Files

Files Size Format View
ArchMathRetro_040-2004-1_3.pdf 221.1Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo