WO2024201395 - RANDOM GENERATOR OF ORTHOGONAL MATRICES IN FINITE FIELDS

National phase entry:
Publication Number WO/2024/201395
Publication Date 03.10.2024
International Application No. PCT/IB2024/053068
International Filing Date 29.03.2024
Title **
[English] RANDOM GENERATOR OF ORTHOGONAL MATRICES IN FINITE FIELDS
[French] GÉNÉRATEUR ALÉATOIRE DE MATRICES ORTHOGONALES DANS CHAMPS FINIS
Applicants **
NEW YORK UNIVERSITY IN ABU DHABI CORPORATION Saadiyat Island P.O. Box 129188 Abu Dhabi, AE
Inventors
EPHREMIDZE, Lasha Saadiyat Island P.O. Box 129188 Abu Dhabi, AE
SPITKOVSKY, Ilya Saadiyat Island P.O. Box 129188 Abu Dhabi, AE
Priority Data
63/455,534   29.03.2023   US
front page image
Application details
Total Number of Claims/PCT *
Number of Independent Claims *
Number of Priorities *
Number of Multi-Dependent Claims *
Number of Drawings *
Pages for Publication *
Number of Pages with Drawings *
Pages of Specification *
*
*
International Searching Authority
*
Applicant's Legal Status
*
*
*
*
*
Entry into National Phase under
*
Translation

Recalculate

* The data is based on automatic recognition. Please verify and amend if necessary.

** IP-Coster compiles data from publicly available sources. If this data includes your personal information, you can contact us to request its removal.

Quotation for National Phase entry

Country StagesTotal
China Filing1104
EPO Filing, Examination6777
Japan Filing531
South Korea Filing575
USA Filing, Examination2635
MasterCard Visa

Total: 11622

The term for entry into the National Phase has expired. This quotation is for informational purposes only

Abstract[English] Systems and methods for generating n × n orthogonal matrices in the Galois field GF(q) that is highly efficient and can handle large values of n and q. This method is based on random selection. In addition, this method can be used to construct paraunitary filter banks over finite fields, in applications such as signal processing. This approach can be useful constructing orthogonal matrices that satisfy specific constraints, making it potentially valuable for applications in coding theory and encryption.[French] L'invention concerne des systèmes et des procédés permettant de générer n × n matrices orthogonales dans le champ de Galois GF(q) qui est hautement efficace et peut traiter de grandes valeurs de n et q. Le présent procédé repose sur une sélection aléatoire. De plus, le présent procédé peut être utilisé pour construire des bancs de filtres paraunitaires sur des champs finis, dans des applications telles que le traitement de signaux. La présente approche peut être utile pour construire des matrices orthogonales qui satisfont des contraintes spécifiques, ce qui la rend potentiellement utile pour des applications dans la théorie de codage et le chiffrement.
An error has occurred. This application may no longer respond until reloaded. Reload 🗙