Journal
Scientific and technical journal «Priborostroenie»
UDK004.056.2
Issue:8 (56)
Download PDF346 Kbyte
THE LOWER BOUND OF SYSTEMATIC UNIFORMLY ROBUST CODE LENGTH
Annotation
Basic definitions of error-detecting robust codes are formulated; the area of the codes application is described. The lower bound of the length of systematic R-uniformly distributed codes is deduced. Comparison with the present-day results is carried out.
Keywords
Постоянный URL
Articles in current issue
- AN APPROACH TO DEVELOPMENT OF BLOCK-COMMUTATIVE CODES WITH LOW DENSITY OF PARITY CHECK
- MODIFICATION OF GOERTZEL-BLAHUT ALGORITHM
- A NEW ALGORITHM FOR LIST DECODING OF TURBO CODES
- A NEW CONSTRUCTION OF SYSTEMATIC ROBUST CODE
- A METHOD OF ASSESSMENT OF WIRELESS NETWORK TOPOLOGY WITH THE USE OF A PRIORY INFORMATION ON DEVICE POSITION
- ANALYSIS OF INTERFERENCE CANCELLATION PROCEDURE IN OFDM SYSTEMS WITH RANDOM MULTIPLE ACCESS
- SYNTHESIS OF OPTIMAL RULE OF SIGNAL RECEPTION AGAINST CROSS TALK IN WCAN SYSTEM
- ON CALCULATION OF MESSAGE DELAY WITH CODING ON TRANSPORT LAYER OF DATA-TRANSMISSION NETWORK
- ANALYSIS OF ENERGY-SAVING MODES IN MOBILE USER DEVICE
- PROTECTION OF ULTRA-LIGHT AUTHENTICATION PROTOCOLS AGAINST ATTACKS ON LSB
- METHOD OF SIDE INFORMATION GENERATION FOR DISTRIBUTED VIDEO CODING SYSTEMS
- VIDEO WATERMARKING ALGORITHM FOR H.264 COMPRESSED VIDEO
- EFFICIENCY ASSESSMENT OF CACHE PARTITION SIZES MANAGEMENT ALGORITHM IN STORAGE SYSTEM
- ESTIMATION OF RELIABILITY OF FAILURE-SAFE CLUSTERS WITH DIRECT CONNECTION TO STORAGE DEVICES