Estee's Pleadings, practice, and forms : adapted to actions and special proceedings under codes of civil procedure /

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

Cowdery's new book of forms, being legal forms and precedents for court proceedings and business transactions, elaborately annotated. Especially adapted to the codes and statutes of Alaska, Arizona, California, Colorado, Idaho, Montana, Nevada, New Mexico, North Dakota, Oregon, South Dakota, Utah, Washington and Wyoming.

Other editions published under title: 1895: Forms and precedents; 1918: Form book; 1933: Forms.

Deering's California codes.

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

Building codes for community development and construction progress.

Cover title.

Building codes: a program for intergovernmental reform; a Commission report.

"A-28."

Activity codes, organizational codes and definitions used in extramural programs : A computer-based information system on the extramural programs of NIH.

NIH manual issuance 4101.

Codes, operations instructions, regulations, and interpretations /

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

Corporate governance codes in Australia and New Zealand: Propriety and prosperity

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.

Statistical mechanics of error-correcting codes

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.

Finite connectivity systems as error-correcting codes

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.

Simple Gallager codes for BSC

We investigate the performance of Gallager type error- correcting codes for Binary Symmetric Channels, 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, with improved decoding properties is obtained for finite K and C.

Error-correcting codes that nearly saturate Shannon's bound

Gallager-type error-correcting codes that nearly saturate Shannon's bound are constructed using insight gained from mapping the problem onto that of an Ising spin system. The performance of the suggested codes is evaluated for different code rates in both finite and infinite message length.