Sciweavers

3852 search results - page 202 / 771
» Construction of Codes for Network Coding
Sort
View
LCN
2007
IEEE
15 years 10 months ago
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
Sunoh Choi, Sang-Seon Byun, Chuck Yoo
TIP
2008
95views more  TIP 2008»
15 years 4 months ago
Optimization of Packetization Masks for Image Coding Based on an Objective Cost Function for Desired Packet Spreading
In image communication over lossy packet networks (e.g., cell phone communication) packet loss errors lead to damaged images. Damaged images can be repaired with passive error conc...
Joost Rombaut, Aleksandra Pizurica, Wilfried Phili...
SETA
2004
Springer
93views Mathematics» more  SETA 2004»
15 years 9 months ago
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
Lars Eirik Danielsen, Matthew G. Parker
NN
2011
Springer
348views Neural Networks» more  NN 2011»
14 years 11 months ago
Tree-like hierarchical associative memory structures
In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. These networks offer very generous storage capacities (both asy...
João Sacramento, Andreas Wichert
WCNC
2008
IEEE
15 years 11 months ago
Interleave Division Multiplexing Aided Space-Time Coding for High-Throughput Uplink Cooperative Communications
— In this paper, we design and investigate a novel Interleave Division Multiplexing based Space-Time Code (IDM-STC) in the context of cooperative communications. We outline the p...
Rong Zhang, Lajos Hanzo