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 | |
Results tagged with reference-request
Search options not deleted
user 16739
This tag is used if a reference is needed in a paper or textbook on a specific result.
4
votes
0
answers
186
views
Reference request for generalized root systems
Where can I find information on root systems where the inner product
is other than the standard (all positive) signature?
- 451
2
votes
1
answer
2k
views
Effects of shortening and puncturing on codes
Given a binary block code $C=[n,k]$ of codeword length $n$, and dimension $k$.
Suppose I've determined these properties for it : $d_{min}$ (minimum distance),
$N_{dmin}$ (number of codewords at $d_{mi …
- 451
1
vote
1
answer
247
views
characterize certain type of matrices
I am trying to characterize matrices with a certain property :
Define $U$ as an $n \times n$ matrix (over C or R; you can also assume
that it is unitary or orthogonal if it helps). Now take $n$
unknow …
- 451