The following pages link to Jozef Woźniak (Q590282):
Displaying 46 items.
- HEX: scaling honeycombs is easier than scaling clock trees (Q269518) (← links)
- Jittering performance of random deflection routing in packet networks (Q391462) (← links)
- Bitonic sorters of minimal depth (Q533870) (← links)
- Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems (Q579215) (← links)
- (Q685438) (redirect page) (← links)
- On the concatenation of infinite traces (Q685439) (← links)
- The decision fusion in the wireless network with possible transmission errors (Q712690) (← links)
- Randomized and nonrandomized algorithms of random multiple access (Q753784) (← links)
- Asymptotic stabilization in the decentralized ALOHA algorithm. Diffusion approximation (Q753785) (← links)
- Packet delay in the case of a multiple-access stack algorithm (Q800288) (← links)
- Coding in an asynchronous multiple-access channel (Q800291) (← links)
- Universal coding for discrete memoryless sources uniform with respect to output (Q809982) (← links)
- Weight distributions of subfield subcodes of algebraic-geometrical codes (Q809986) (← links)
- Exact observability conditions for Hilbert space dynamical systems connected with Riesz basis of divided differences (Q826777) (← links)
- Challenges and opportunities of connected \(k\)-covered wireless sensor networks. From sensor deployment to data gathering (Q1022030) (← links)
- Dual distance of BCH codes (Q1090660) (← links)
- A lower bound for radio broadcast (Q1176103) (← links)
- Designing fault-tolerant systems using automorphisms (Q1177282) (← links)
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity (Q1186809) (← links)
- The average CRI-length of a controlled ALOHA collision resolution algorithm (Q1208718) (← links)
- Implementation of convolutional decoding algorithms in CDMA systems (Q1276930) (← links)
- Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders (Q1290829) (← links)
- Lower bound on delay in an RMA system with \(N\)-conflicts and errors (Q1310727) (← links)
- Defect-correcting codes (Q1310748) (← links)
- Complexity aspects of guessing prefix codes (Q1336967) (← links)
- Algebraic constructions of asymptotically optimal two-dimensional optical orthogonal codes (Q1375817) (← links)
- A space-time-filtered Viterbi receiver for CCI/ISI reduction in TDMA systems (Q1379634) (← links)
- A course in error-correcting codes. (Q1422079) (← links)
- To the theory of low-density convolutional codes. I (Q1569277) (← links)
- Asymptotic distance properties of binary woven convolutional codes (Q1569278) (← links)
- A posteriori probability decoding of convolutional codes (Q1569283) (← links)
- On the comparative complexity of algorithms for constructing the syndrome trellis of a linear block code (Q1582940) (← links)
- On the theory of low-density convolutional codes. II (Q1812388) (← links)
- Stateless core: A scalable approach for quality of service in the internet. Wining thesis of the 2001 ACM doctoral dissertation competition. (Q1880553) (← links)
- Analysis of critical damage in the communication network. III: Analysis of internode flows (Q2239212) (← links)
- Uniform self-stabilizing ring orientation (Q2366560) (← links)
- Semantics of nondeterministic asynchronous broadcast networks (Q2366562) (← links)
- Computing the modular inverses is as simple as computing the GCDs (Q2469471) (← links)
- An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\) (Q2509242) (← links)
- Capacity bounds for a channel with synchronization errors (Q2639829) (← links)
- (Q3340769) (← links)
- (Q3708685) (← links)
- (Q3710447) (← links)
- R-express: Collision-free access protocol for packet radio networks (Q3813761) (← links)
- (Q4081115) (← links)
- (Q4208836) (← links)
