On the public citation graph

Matrices over a Finite Field

0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/wcm.1189openalex-snapshot
Fountain Codes Over GF(q)
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_8openalex-snapshot
Rebound Distinguishers: Results on the Full Whirlpool Compression Function
inferred← citeshttps://doi.org/10.1007/bf02666988openalex-snapshot
Limit distribution of the number of solutions of a system of stochastic linear homogeneous equations with a uniform coefficient matrix over a finite local ring
inferred← citeshttps://doi.org/10.1007/s00145-013-9166-5openalex-snapshot
The Rebound Attack and Subspace Distinguishers: Application to Whirlpool
inferred← citeshttps://doi.org/10.1007/s00200-021-00498-4openalex-snapshot
Left ideals of matrix rings and error-correcting codes
inferred← citeshttps://doi.org/10.1007/s002000050060openalex-snapshot
The Matroid of Supports of A Linear Code
inferred← citeshttps://doi.org/10.1007/s00222-021-01082-wopenalex-snapshot
Random integral matrices: universality of surjectivity and the cokernel
inferred← citeshttps://doi.org/10.1007/s00607-009-0034-yopenalex-snapshot
Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers
inferred← citeshttps://doi.org/10.1007/s10801-021-01052-8openalex-snapshot
Characters of unipotent radicals of standard parabolic subgroups with 3 parts
inferred← citeshttps://doi.org/10.1016/0024-3795(73)90016-5openalex-snapshot
Enumeration of matrices with prescribed row and column sums
inferred← citeshttps://doi.org/10.1016/j.disc.2005.10.002openalex-snapshot
Extensions of the Critical Theorem
inferred← citeshttps://doi.org/10.1016/j.jco.2012.07.001openalex-snapshot
On the complexity of solving quadratic Boolean systems
inferred← citeshttps://doi.org/10.1016/j.jco.2024.101898openalex-snapshot
On the number of solutions to a random instance of the permuted kernel problem
inferred← citeshttps://doi.org/10.1016/j.jnt.2024.12.006openalex-snapshot
On a twisted Jacquet module of GL(2n) over a finite field
inferred← citeshttps://doi.org/10.1016/j.jpaa.2021.106932openalex-snapshot
A certain twisted Jacquet module of GL(4) over a finite field
inferred← citeshttps://doi.org/10.1016/j.laa.2011.08.049openalex-snapshot
Counting matrices over finite fields having a given number of rows of unit weight
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00032-3openalex-snapshot
Satisfiability threshold for random XOR-CNF formulas
inferred← citeshttps://doi.org/10.1017/s0004972723001004openalex-snapshot
SOME COUNTING QUESTIONS FOR MATRIX PRODUCTS
inferred← citeshttps://doi.org/10.1080/03081088708817811openalex-snapshot
The probability that a linear system is consistent
inferred← citeshttps://doi.org/10.1090/s0025-5718-04-01725-9openalex-snapshot
𝑝-class groups of certain extensions of degree 𝑝
inferred← citeshttps://doi.org/10.1109/icc.2010.5501815openalex-snapshot
Network Resources Optimization for Random Linear Network Coding
inferred← citeshttps://doi.org/10.1109/isit.2010.5513667openalex-snapshot
An upper bound on the separating redundancy of linear block codes
inferred← citeshttps://doi.org/10.1109/isit.2011.6034142openalex-snapshot
On the capacity of multiplicative finite-field matrix channels
inferred← citeshttps://doi.org/10.1109/isit.2016.7541292openalex-snapshot
Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets
inferred← citeshttps://doi.org/10.1109/isit.2016.7541598openalex-snapshot
Probabilistic bounds on the trapping redundancy of linear codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2245939openalex-snapshot
Parity-Check Matrices Separating Erasures From Errors
inferred← citeshttps://doi.org/10.1109/tit.2013.2253542openalex-snapshot
On the Capacity of Multiplicative Finite-Field Matrix Channels
inferred← citeshttps://doi.org/10.1109/tit.2018.2871477openalex-snapshot
Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.3038272openalex-snapshot
Generalized Linkage Construction for Constant-Dimension Codes
inferred← citeshttps://doi.org/10.1109/tit.2021.3115432openalex-snapshot
Decoding of Interleaved Alternant Codes
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.1201/b16113-35openalex-snapshot
Matrices over Finite Fields
inferred← citeshttps://doi.org/10.1515/forum-2024-0114openalex-snapshot
Statistics of ranks, determinants and characteristic polynomials of rational matrices
inferred← citeshttps://doi.org/10.1515/jmc-2024-0008openalex-snapshot
Smaller public keys for MinRank-based schemes
inferred← citeshttps://doi.org/10.1515/spma-2021-0150openalex-snapshot
Enumeration of some matrices and free linear codes over commutative finite local rings
inferred← citeshttps://doi.org/10.5802/jtnb.471openalex-snapshot
Cohen-Lenstra sums over local rings
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.