The following pages link to Robert Calderbank (Q427069):
Displaying 50 items.
- Two are better than one: fundamental parameters of frame coherence (Q427070) (← links)
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes (Q517737) (← links)
- Congestion control and its stability in networks with delay sensitive traffic (Q551684) (← links)
- Volume thresholds for quantum fault tolerance (Q600894) (← links)
- Sparse fusion frames: existence and construction (Q647422) (← links)
- Construction of a \((64,2^{37},12)\) code via Galois rings (Q676706) (← links)
- Double circulant codes over \(\mathbb{Z}_ 4\) and even unimodular lattices (Q679085) (← links)
- The Sperner capacity of linear and nonlinear codes for the cyclic triangle (Q686982) (← links)
- (Q795065) (redirect page) (← links)
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs (Q795067) (← links)
- The Haemers partial geometry and the Steiner system S(5,8,24) (Q799680) (← links)
- Covering radius and the chromatic number of Kneser graphs (Q805622) (← links)
- The mathematics of modems (Q807598) (← links)
- Construction and analysis of a new quanternionic space-time code for 4 transmit antennas (Q820200) (← links)
- The finite Heisenberg-Weyl groups in radar and communications (Q871465) (← links)
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery (Q1006638) (← links)
- (Q1053657) (redirect page) (← links)
- Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\) (Q1053659) (← links)
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\) (Q1066907) (← links)
- The extension to root systems of a theorem on tournaments (Q1077428) (← links)
- Functions that never agree (Q1104947) (← links)
- The application of invariant theory to the existence of quasi-symmetric designs (Q1107532) (← links)
- Symmetric designs as the solution of an extremal problem in combinatorial set theory (Q1108273) (← links)
- Inequalities for quasisymmetric designs (Q1113903) (← links)
- Geometric invariants for quasi-symmetric designs (Q1113904) (← links)
- A good method of combining codes (Q1145124) (← links)
- A global code invariant under the Higman-Sims group (Q1167810) (← links)
- Covering bounds for codes (Q1186114) (← links)
- Covering machines (Q1199588) (← links)
- Quasi-symmetric designs and the Smith normal form (Q1200312) (← links)
- Wavelet transforms that map integers to integers (Q1271628) (← links)
- A group-theoretic framework for the construction of packings in Grassmannian spaces (Q1283451) (← links)
- Maximal three-independent subsets of \(\{0,1,2\}^ n\) (Q1329111) (← links)
- An Erdős-Ko-Rado theorem for regular intersecting families of octads (Q1821104) (← links)
- Modular and \(p\)-adic cyclic codes (Q1894267) (← links)
- \(\mathbb{Z}_ 4\)-linear codes obtained as projections of Kerdock and Delsarte-Goethals codes (Q1899440) (← links)
- Approximate unitary 3-designs from transvection Markov chains (Q2168080) (← links)
- Robust dimension reduction, fusion frames, and Grassmannian packings (Q2517716) (← links)
- Space-time codes for high data rate wireless communication: performance criteria in the presence of channel estimation errors, mobility, and multiple paths (Q2732717) (← links)
- (Q2741174) (← links)
- Classification and Reconstruction of High-Dimensional Signals From Low-Dimensional Features in the Presence of Side Information (Q2976529) (← links)
- Two-User Erasure Interference Channels With Local Delayed CSIT (Q2976617) (← links)
- Conditioning of Random Block Subdictionaries With Applications to Block-Sparse Recovery and Regression (Q2977390) (← links)
- Discrimination on the Grassmann Manifold: Fundamental Limits of Subspace Classifiers (Q2978714) (← links)
- A Bregman Matrix and the Gradient of Mutual Information for Vector Poisson and Gaussian Channels (Q2986374) (← links)
- An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes (Q2986387) (← links)
- Soft-Decoding-Based Strategies for Relay and Interference Channels: Analysis and Achievable Rates Using LDPC Codes (Q2986425) (← links)
- Extending the t-Design Concept (Q3137507) (← links)
- Sequencing two servers on a sphere (Q3217405) (← links)
- A new description of trellis codes (Q3221876) (← links)
