Judul: The Competitiveness of Humpback Grouper (Cromileptes altivelis) in South Painan Village, Pesisir Selatan Regency, West Sumatra Province
Abstrak: Desa Painan Selatan merupakan sentra produksi ikan kerapu bebek hasil budi daya di Kabupaten Pesisir Selatan, Provinsi Sumatera Barat. Ikan kerapu bebek yang dihasilkan telah memasuki pasar ekspor beberapa negara di dunia, namun biaya produksi yang tinggi, harga output dan input yang tidak stabil dan luas keramba jaring apung yang relatif kecil menjadi kendala bagi produsen ikan kerapu bebek di Desa Painan Selatan untuk mengembangkan usahanya. Kondisi ini berpengaruh terhadap daya saing ikan kerapu bebek di Desa Painan Selatan. Berdasarkan permasalahan tersebut, maka tujuan dari penelitian ini yaitu (1) menganalisis keunggulan kompetitif dan komparatif ikan kerapu bebek di Desa Painan Selatan, (2) menganalisis pengaruh perubahan harga output dan input terhadap keunggulan kompetitif dan komparatif ikan kerapu bebek di Desa Painan Selatan. Metode analisis yang digunakan pada penelitian ini yaitu Policy Analysis Matrix (PAM) dan analisis sensitivitas pada PAM. Hasil analisis PAM menunjukkan bahwa ikan kerapu bebek di Desa Painan Selatan memiliki keunggulan kompetitif dan komparatif, karena nilai PCR dan DRCR yang dihasilkan lebih kecil dari satu. Adapun hasil analisis sensitivitas menunjukkan bahwa perubahan harga output dan input menurunkan keunggulan kompetitif ikan kerapu bebek di Desa Painan Selatan, namun masih berdaya saing karena nilai yang dihasilkan masih lebih kecil dari satu., South Painan Village is a production center of humpback grouper aquaculture in Pesisir Selatan Regency, West Sumatra Province. The humpback grouper produced has entered the export market, however the high costs of humpback grouper of aquaculture, unstable output and input prices and the relatively small area of floating net cages are considered to be obstacles for humpback grouper farmers to develop their business. This condition affects the competitiveness of humpback grouper in South Painan Village. The objectives of this research are to:(1) analyze the competitive and comparative advantages of humpback grouper in South Painan Village; (2) analyze the effect of changes in output and input prices on the competitive and comparative advantage of humpback grouper in South Painan Village. The analytical method used in this research are Policy Analysis Matrix (PAM) and sensitivity analysis on PAM. The results of the PAM analysis showed that the humpback grouper farming business in South Painan Village has competitive and comparative advantages, because the PCR and DRCR values are smaller than one. The results of the sensitivity analysis showed that changes in output and input prices reduce the competitive advantage of humpback grouper, but still has competitiveness because the PCR value is smaller than one.
Keyword: competitive advantage, comparative advantage, Policy Analysis Matrix (PAM), sensitivity analysis

Judul: Business Strategy Grouper (Epinephelus sp.) CV. Jaya Abadi in Subi Village Subi District Natuna Regency
Abstrak: CV. Jaya Abadi merupakan badan usaha yang bergerak dalam usaha keramba jaring apung ikan kerapu di Pulau Subi. Pada CV. Jaya Abadi yang memiliki produksi yang cukup bagus, terdapat permasalahan dalam menjalankan bisnis baik dari berbagai sisi pada perusahan, dari segi harga ikan dan pemasaran yang belum stabil, persaingan yang semakin ketat, kerusakan pada ikan, serta gangguan hama dan penyakit ikan kerapu yang menimbulkan kerugian pada perusahaan sehingga membutuhkan alternatif-alternatif strategi dalam menjalankan dan mengembangkan usaha perusahaan. Penelitian ini bertujuan untuk menganalisis faktor intenal dan eksternal, merumuskan strategi alternatif, serta menentukan prioritas strategi bagi CV. Jaya Abadi. Metode yang digunakan dalam penelitian ini adalah matriks IFE, matriks EFE, matriks IE, matriks SWOT, dan matriks QSP. Hasil analisis menunjukkan bahwa CV. Jaya Abadi berada pada kondisi menjaga dan mempertahankan. Perumusan strategi didasarkan pada posisi matriks IE dan analisis matriks SWOT sehingga menghasilkan lima alternatif strategi. Berdasarkan hasil analisis matriks QSP diperoleh prioritas alternatif strategi yaitu melakukan kerjasama dengan pengusaha ikan kerapu yang berpengalaman dalam hal mengatasi gangguan hama dan penyakit ikan kerapu serta bidang pemasaran dengan nilai STAS sebesar 6.9025., CV. Jaya Abadi is a business entity engaged in the business of grouper floating net cages on Subi Island. On CV. Jaya Abadi, which has a fairly good production, there are problems in running a business both from various sides of the company, in terms of unstable fish prices and marketing, increasingly fierce competition, damage to fish, as well as pest and grouper diseases that cause losses to the company. The company so that it requires alternative strategies in running and developing the company's business. This study aims to analyze internal and external factors, formulate alternative strategies, and determine strategic priorities for CV. Jaya Abadi. The methods used in this research are IFE matrix, EFE matrix, IE matrix, SWOT matrix, and QSP matrix. The results of the analysis show that CV. Jaya Abadi is in a state of maintaining and maintaining. The strategy formulation is based on the position of the IE matrix and SWOT matrix analysis so as to produce five alternative strategies. Based on the results of the QSP matrix analysis, an alternative strategic priority is obtained, namely collaborating with grouper entrepreneurs who are experienced in dealing with grouper pests and diseases and in the marketing field with an STAS value of 6.9025.
Keyword: Grouper, IE Matrix, QSP Matrix, SWOT Matrix, Strategy

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: