Walsh–Hadamard code

Results: 10



#Item
1Single-Query Learning from Abelian and non-Abelian Hamming Distance Oracles

Single-Query Learning from Abelian and non-Abelian Hamming Distance Oracles

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-02 15:44:58
211 JuneSINGLE-QUERY LEARNING FROM ABELIAN AND NON-ABELIAN HAMMING DISTANCE ORACLES David A. Meyer∗ and James Pommersheim∗,†

11 JuneSINGLE-QUERY LEARNING FROM ABELIAN AND NON-ABELIAN HAMMING DISTANCE ORACLES David A. Meyer∗ and James Pommersheim∗,†

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-03 17:29:55
3SPREADING SEQUENCES USED IN CDMA  Walsh Code - One of the 64 orthogonal bit pattern at a rate of[removed]Mcps. Walsh codes are used to identify the data for each individual transmission. In the forward link, they define f

SPREADING SEQUENCES USED IN CDMA Walsh Code - One of the 64 orthogonal bit pattern at a rate of[removed]Mcps. Walsh codes are used to identify the data for each individual transmission. In the forward link, they define f

Add to Reading List

Source URL: wirelessapplications.com

Language: English - Date: 2008-01-29 19:34:34
4Iterative Multi-User Detection and Decoding for DS-CDMA System with SpaceTime Linear Dispersion Pei Xiao† , Member, IEEE, Jinsong Wu†† , Member, IEEE, Mathini Sellathurai† , Senior Member, IEEE, T. Ratnarajah†

Iterative Multi-User Detection and Decoding for DS-CDMA System with SpaceTime Linear Dispersion Pei Xiao† , Member, IEEE, Jinsong Wu†† , Member, IEEE, Mathini Sellathurai† , Senior Member, IEEE, T. Ratnarajah†

Add to Reading List

Source URL: epubs.surrey.ac.uk

Language: English - Date: 2013-09-23 15:18:20
5Computer Science Technical Report Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe

Computer Science Technical Report Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe

Add to Reading List

Source URL: www.cs.colostate.edu

Language: English - Date: 2010-06-24 19:04:53
6Chapter 6  Modifying Codes If one code is in some sense good, then we can hope to find from it similar and related codes that are also good. In this chapter we discuss some elementary methods for modifying a code in orde

Chapter 6 Modifying Codes If one code is in some sense good, then we can hope to find from it similar and related codes that are also good. In this chapter we discuss some elementary methods for modifying a code in orde

Add to Reading List

Source URL: www.mth.msu.edu

Language: English - Date: 2012-08-31 11:04:32
7On the List-Decodability of Random Linear Codes∗ Venkatesan Guruswami† Computer Science Dept. Carnegie Mellon University Johan H˚ astad ‡

On the List-Decodability of Random Linear Codes∗ Venkatesan Guruswami† Computer Science Dept. Carnegie Mellon University Johan H˚ astad ‡

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2010-09-15 15:12:42
8Error Correcting Codes: Combinatorics, Algorithms and Applications  (Fall 2007)

Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007)

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 2010-02-11 10:03:08
9Locally Decodable Codes Sergey Yekhanin Microsoft Research Silicon Valley

Locally Decodable Codes Sergey Yekhanin Microsoft Research Silicon Valley

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2012-01-23 12:03:07
10

PDF Document

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 2010-02-11 10:03:08