CONSTRUCTION OF HADAMARD MATRICES FROM CERTAIN FROBENIUS GROUP

α
M.K.Singh
M.K.Singh
σ
P.K.Manjhi
P.K.Manjhi
α Ranchi University

Send Message

To: Author

CONSTRUCTION OF HADAMARD MATRICES FROM CERTAIN FROBENIUS GROUP

Article Fingerprint

ReserarchID

37Q7P

CONSTRUCTION OF HADAMARD MATRICES FROM CERTAIN FROBENIUS GROUP Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

Hadamard matrices have many application in computer science and communication technology. It is shown that two classical methods of constructing Hadamard matrices viz., those of Paley’s and Williamson’s can be unified and Paley’s and Williamson’s Hadamard matrices can be constructed by a uniform method i.e. producing an association scheme or coherent configuration by Frobenius group action and then producing Hadamard matrices by taking suitable (1-1) -linear combinations of adjacency matrices of the coherent configuration.

References

10 Cites in Article
  1. J Alperin,Rowen Bell (1995). Groups and representation.
  2. R Bose,Dale Mesner (1959). On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs.
  3. Collin,J,D Perkinson (2004). Elsevier Internet Homepage - http://www.elsevier.com.
  4. D Joh,Brian Dixon,Mortimer (1996). Permutation group.
  5. D Djokovic (1993). Williamson matrices of order 4n for n=33.
  6. D Higman (1976). Coherent Configuration part-1, Ordinary representation Theory.
  7. Bertram Huppert (1998). Character theory of finite groups.
  8. R Paley (1933). On orthogonal matrices.
  9. M Singh,K Sinha,S Kageyama (2004). Unknown Title.
  10. J Williamson (1944). Hadamard determinant theorem and the sum of four squares.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

M.K.Singh. 1970. \u201cCONSTRUCTION OF HADAMARD MATRICES FROM CERTAIN FROBENIUS GROUP\u201d. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 10): .

Download Citation

Issue Cover
GJCST Volume 11 Issue 10
Pg. 45- 50
Journal Specifications
Keywords
Version of record

v1.2

Issue date

May 25, 2011

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 20796
Total Downloads: 11171
2026 Trends
Related Research

Published Article

Hadamard matrices have many application in computer science and communication technology. It is shown that two classical methods of constructing Hadamard matrices viz., those of Paley’s and Williamson’s can be unified and Paley’s and Williamson’s Hadamard matrices can be constructed by a uniform method i.e. producing an association scheme or coherent configuration by Frobenius group action and then producing Hadamard matrices by taking suitable (1-1) -linear combinations of adjacency matrices of the coherent configuration.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

CONSTRUCTION OF HADAMARD MATRICES FROM CERTAIN FROBENIUS GROUP

M.K.Singh
M.K.Singh Ranchi University
P.K.Manjhi
P.K.Manjhi

Research Journals