936 resultados para MRD codes


Relevância:

20.00% 20.00%

Publicador:

Resumo:

"Greg J. Duncan and James N. Morgan are the principal researchers."

Relevância:

20.00% 20.00%

Publicador:

Resumo:

First edition has title: Practice, pleading and forms...

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Kept up to date by pocket parts, legislative service and recompiled vols

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Cover title.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Current through transmittal memo no. 204, October 12, 1994.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Overview of the central features of corporate governance codes, 'Principles of Good Corporate Governance and Best Practice Recommendations' (released by the ASX Corporate Governance Council) and 'Corporate Governance in New Zealand, Principles and Guidelines' (released by New Zealand Securities Commission) - whether the codes address the right problem - are the solutions of independence and disclosure conceptually and practically viable - whether codes pay sufficient attention to wealth creation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigate the performance of error-correcting codes, where the code word comprises products of K bits selected from the original message and decoding is carried out utilizing a connectivity tensor with C connections per index. Shannon's bound for the channel capacity is recovered for large K and zero temperature when the code rate K/C is finite. Close to optimal error-correcting capability is obtained for finite K and C. We examine the finite-temperature case to assess the use of simulated annealing for decoding and extend the analysis to accommodate other types of noisy channels.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigate the performance of parity check codes using the mapping onto spin glasses proposed by Sourlas. We study codes where each parity check comprises products of K bits selected from the original digital message with exactly C parity checks per message bit. We show, using the replica method, that these codes saturate Shannon's coding bound for K?8 when the code rate K/C is finite. We then examine the finite temperature case to asses the use of simulated annealing methods for decoding, study the performance of the finite K case and extend the analysis to accommodate different types of noisy channels. The analogy between statistical physics methods and decoding by belief propagation is also discussed.