Judul: Analisis Efisiensi Pemasaran dan Pendapatan Usaha Pengolahan Ikan Teri Asin di Pulau Pasaran Kota Bandar Lampung.
Abstrak: Permasalahan utama pada usaha pengolahan ikan teri asin di Pulau Pasaran adalah sistem pemasaran dan pembiayaan. Sentra pengolahan ini memberikan produksi olahan hasil perikanan tertinggi di Provinsi Lampung, namun hal itu tidak sejalan dengan hasil perikanan yang dipasarkan di Kota Bandar Lampung. Tujuan utama penelitian adalah 1) mengidentifikasi pengadaan input dan hasil produksi usaha pengolahan ikan teri asin, 2) mengidentifikasi struktur, perilaku dan kinerja pasar (S-C-P) pada saluran pemasaran usaha pengolahan ikan teri asin, dan 3) menganalisis efisiensi pemasaran dan pendapatan usaha pengolahan ikan teri asin di Pulau Pasaran Kota Bandar Lampung. Hasil analisis menunjukkan pengolahan dengan input produksi ikan basah sebanyak 2,16 kg akan menghasilkan produksi sebanyak 1 kg ikan teri kering. Selanjutnya, saluran pemasaran 3 merupakan saluran yang paling efisien dengan nilai mrjin pemasaran sebesar 3,23 untuk ikan teri buntiau dan sebesar 5,13 untuk ikan teri jengki. Rata-rata pendapatan pengolah skala usaha kecil adalah sebesar Rp 25.667.720 per orang per bulan, pengolah skala usaha menengah sebesar Rp 75.130.861 per orang per bulan dan pengolah skala usaha besar sebesar Rp 176.441.169 per orang per bulan pada saat kondisi musim angin normal. Hasil penelitian ini diharapkan dapat menjadi dasar dalam penyusunan kebijakan terkait dengan perbaikan sistem pemasaran dan permodalan usaha pengolahan ikan teri asin di Pulau Pasaran
Keyword: Usaha pengolahan, analisis input dan hasil produksi, S-C-P, efisiensi saluran pemasaran

Judul: Analisis Kebijakan Ekonomi Kelembagaan Pengembangan Klaster Industri Pengolahan Ikan Teri di Pulau Pasaran Kota Bandar Lampung
Abstrak: Lampung Province has potential resource in fisheries. One of the potential fisheries commodity in Lampung Province is anchovy which is produced by lift net in Lampung Bay. The final product of anchovy is dry-salted anchovy which has local name “teri”, process mainly in Pulau Pasaran, Teluk Betung Timur, Bandar Lampung City. Types of anchovy that produced, are “teri nasi”, “teri jengki”, and “teri nilon”. According to Ministerial Decree No. 32 Tahun 2010, Pulau Pasaran has been established as “minapolitan area”. Development of anchovy cluster industry in Pulau Pasaran based on strategic planning was decided by stakeholders and endorsed by Mayor Decree of Bandar Lampung No. 256/23/HK/2011. The objectives of this research were to analyze institutional frameworks, to evaluate influence and importance of stakeholders, to review efficiency and institutional design, and to evaluate alternative policy. This research used four methods that are institutional analysis, influence and importance analysis, transaction cost, and Analytical Hierarchy Process (AHP). The result showed that institutional frameworks in Pulau Pasaran anchovy processing cluster industry development is facing conflict between processors with fishermen and intermediate users. Market efficiency has not been supported by strong supply chain system because of lack capacity of cluster industry stakeholders. The economics foundation of industry cluster pyramid has to be developed by improving management skill, increase of capital investment, and marketing capability. Transaction cost ratio showed that volume of production has not been influenced by transaction cost. AHP analysis suggests that group of processor capability in management should be developed as the first priority, followed by developing access of market, improving of financial support, trainning of processing technology, and developing infrastructure.
Keyword: Pulau Pasaran, Anchovy Processing, Industry Cluster, Transaction Cost, Analytic Hierarchy Process

Judul: Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Abstrak: A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11.
Keyword: