Lower bounds on rate of fixed-length source codes under average- and 6-fidelity constraints

Author(s):  
Pierre Moulin
1976 ◽  
Vol 22 (3) ◽  
pp. 321-331 ◽  
Author(s):  
Marcel Herzog ◽  
K. B. Reid

AbstractWe study the problem of representing a permutation C as a product of a minimum number, fk(C), of cycles of length k. Upper and lower bounds on fk(C) are obtained and exact results are derived for k = 2, 3, 4.


2001 ◽  
Vol 47 (4) ◽  
pp. 1461-1472 ◽  
Author(s):  
K. Visweswariah ◽  
S.R. Kulkarni ◽  
S. Verdu

1968 ◽  
Vol 07 (03) ◽  
pp. 156-158
Author(s):  
Th. R. Taylor

The technique, scope and limitations of a fixed field/fixed length case record utilising the IBM 1232 system is described. The principal problems lie with personnel rather than machinery and with programmes for analysis rather than clinical data.


Sign in / Sign up

Export Citation Format

Share Document