Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
A finite field is a field with a finite number of elements. For each prime power $q^k$, there is a unique (up to isomorphism) finite field with $q^k$ elements. Up to isomorphism, these are the only finite fields.
2
votes
Compressing a system of linear equations
I think I got what you mean. Please correct me if I misunderstand your question.
So, I think "$0 < \vert M_i\vert < m$" in the description of property $\Gamma$ should read "$0 < \vert M_i\vert \leq k …
3
votes
Accepted
Ranks of higher incidence matrices of designs
For the generalization in the first direction, the $p$-rank of the incidence matrix $N$ of an $S(2,k,v)$ is lower bounded by the dimension of the Steinberg module:
$$\operatorname{rank}_2(N)(\operato …
4
votes
Accepted
On MDS code property
I guess you exclude trivial MDS codes, generalized Reed-Solomon codes, and MDS codes that can be obtained by code extension.
If you exclude them all, there are still a bunch of MDS codes. In general, …