default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNadya Markin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j11]Nadya Markin, Eldho K. Thomas
, Frédérique E. Oggier:
On group violations of inequalities in five subgroups. Adv. Math. Commun. 10(4): 871-893 (2016)- [j10]Amaro Barreal, Camilla Hollanti, Nadya Markin:
Fast-Decodable Space-Time Codes for the N-Relay and Multiple-Access MIMO Channel. IEEE Trans. Wirel. Commun. 15(3): 1754-1767 (2016) - 2015
- [j9]Grégory Berhuy, Nadya Markin, B. A. Sethuraman:
Bounds on Fast Decodability of Space-Time Block Codes, Skew-Hermitian Matrices, and Azumaya Algebras. IEEE Trans. Inf. Theory 61(4): 1959-1970 (2015) - [i11]Nadya Markin, Eldho K. Thomas, Frédérique E. Oggier:
On Group Violations of Inequalities in five Subgroups. CoRR abs/1504.01359 (2015) - [i10]Amaro Barreal, Camilla Hollanti, Nadya Markin:
Constructions of Fast-Decodable Distributed Space-Time Codes. CoRR abs/1504.05058 (2015) - 2014
- [j8]Eldho K. Thomas, Nadya Markin, Frédérique E. Oggier:
On Abelian group representability of finite groups. Adv. Math. Commun. 8(2): 139-152 (2014) - [c9]Amaro Barreal, Camilla Hollanti, Nadya Markin:
Constructions of Fast-Decodable Distributed Space-Time Codes. ICMCTA 2014: 43-51 - [c8]Grégory Berhuy, Nadya Markin, B. A. Sethuraman:
Fast lattice decodability of space-time block codes. ISIT 2014: 1917-1921 - [c7]Nadya Markin, Frédérique E. Oggier:
Information inequalities and finite groups: an overview. ISITA 2014: 694-698 - [i9]Grégory Berhuy, Nadya Markin, B. A. Sethuraman:
Bounds of fast decodability of space time block codes, skew-Hermitian matrices, and Azumaya algebras. CoRR abs/1405.5966 (2014) - [i8]Amaro Barreal, Camilla Hollanti, Nadya Markin:
Fast-Decodable Space-Time Codes for the $N$-Relay and Multiple-Access MIMO Channel. CoRR abs/1412.1257 (2014) - 2013
- [j7]Nadya Markin, Frédérique E. Oggier:
Iterated Space-Time Code Constructions From Cyclic Algebras. IEEE Trans. Inf. Theory 59(9): 5966-5979 (2013) - [c6]Nadya Markin, Eldho K. Thomas, Frédérique E. Oggier:
Groups and information inequalities in 5 variables. Allerton 2013: 804-809 - 2012
- [c5]Camilla Hollanti, Nadya Markin:
Algebraic fast-decodable relay codes for distributed communications. ISIT 2012: 935-939 - [c4]Nadya Markin, Frédérique E. Oggier:
A class of iterated fast decodable space-time codes for 2n Tx antennas. ISIT 2012: 2826-2830 - [i7]Camilla Hollanti, Nadya Markin:
Algebraic Fast-Decodable Relay Codes for Distributed Communications. CoRR abs/1202.5857 (2012) - [i6]Nadya Markin, Frédérique E. Oggier:
Iterated Space-Time Code Constructions from Cyclic Algebras. CoRR abs/1205.5134 (2012) - [i5]Eldho K. Thomas, Nadya Markin, Frédérique E. Oggier:
On Abelian Group Representability of Finite Groups. CoRR abs/1212.1298 (2012) - 2011
- [j6]Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
A few more quadratic APN functions. Cryptogr. Commun. 3(1): 43-53 (2011) - [j5]E. Alekseenko, S. Aleshnikov, Nadya Markin, Alexey Zaytsev:
Optimal curves over finite fields with discriminant -19. Finite Fields Their Appl. 17(4): 350-358 (2011) - [j4]Thomas Unger, Nadya Markin:
Quadratic Forms and Space-Time Block Codes From Generalized Quaternion and Biquaternion Algebras. IEEE Trans. Inf. Theory 57(9): 6148-6156 (2011) - [c3]Nadya Markin, Frédérique E. Oggier:
Iterated MIDO space-time code constructions. Allerton 2011: 539-544
2000 – 2009
- 2009
- [j3]Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
Fourier Spectra of Binomial APN Functions. SIAM J. Discret. Math. 23(2): 596-608 (2009) - 2008
- [j2]Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
New families of quadratic almost perfect nonlinear trinomials and multinomials. Finite Fields Their Appl. 14(3): 703-714 (2008) - [j1]Jyrki T. Lahtonen, Nadya Markin, Gary McGuire:
Construction of Multiblock Space-Time Codes From Division Algebras With Roots of Unity as Nonnorm Elements. IEEE Trans. Inf. Theory 54(11): 5231-5235 (2008) - [i4]Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
Fourier Spectra of Binomial APN Functions. CoRR abs/0803.3781 (2008) - [i3]Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
A Few More Quadratic APN Functions. CoRR abs/0804.4799 (2008) - [i2]Thomas Unger, Nadya Markin:
Quadratic Forms and Space-Time Block Codes from Generalized Quaternion and Biquaternion Algebras. CoRR abs/0807.0199 (2008) - 2007
- [c2]Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
Determining the Nonlinearity of a New Family of APN Functions. AAECC 2007: 72-79 - [c1]Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
On the Walsh Spectrum of a New APN Function. IMACC 2007: 92-98 - [i1]Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
Quadratic Almost Perfect Nonlinear Functions With Many Terms. IACR Cryptol. ePrint Arch. 2007: 115 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
